966 search results - page 4 / 194 » Small Alliances in Graphs |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we investigate the properties of CEAs with populations structured as Watts
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
SIAMDM
2010
13 years 2 months ago
2010
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
JGAA
2007
13 years 7 months ago
2007
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...