3008 search results - page 48 / 602 » Independence in connected graphs |
123
Voted
CCCG
2010
15 years 2 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
96
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2
103
Voted
CCCG
2007
15 years 2 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
109
Voted
HICSS
2011
IEEE
14 years 4 months ago
2011
IEEE
EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common “hashtag” or keyword to identi...
ENDM
2002
15 years 16 days 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...