3008 search results - page 112 / 602 » Independence in connected graphs |
167
click to vote
DM
2007
15 years 6 months ago
2007
Short cycle connectivity is a generalization of ordinary connectivity—two vertices have to be connected by a sequence of short cycles, in which two consecutive cycles have at le...
175
click to vote
JNW
2007
15 years 6 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
151
click to vote
DAM
2008
15 years 6 months ago
2008
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
163
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
172
click to vote
MIAR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...