966 search results - page 4 / 194 » Small Alliances in Graphs |
STOC
2006
ACM
15 years 10 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
15 years 1 months ago
2006
Springer
In this paper we investigate the properties of CEAs with populations structured as Watts
CVPR
2004
IEEE
16 years 4 days ago
2004
IEEE
SIAMDM
2010
14 years 4 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
14 years 10 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...