5889 search results - page 438 / 1178 » Graph Layout Problems |
194
click to vote
WG
2005
Springer
16 years 1 months ago
2005
Springer
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
187
Voted
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
161
click to vote
DAM
2008
15 years 7 months ago
2008
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
160
click to vote
DM
2006
15 years 7 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
191
click to vote
JCT
2006
15 years 7 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....