966 search results - page 2 / 194 » Small Alliances in Graphs |
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
112
click to vote
DM
2007
15 years 1 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
ENDM
2002
15 years 1 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
GD
2005
Springer
15 years 7 months ago
2005
Springer
Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some gen...
106
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...