3008 search results - page 68 / 602 » Independence in connected graphs |
108
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
119
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 1 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
106
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
118
click to vote
JCT
2010
14 years 11 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
120
click to vote
ALGORITHMICA
2010
15 years 28 days ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...