4865 search results - page 103 / 973 » The Complexity of Graph Connectivity |
STOC
1993
ACM
14 years 2 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
JC
2007
13 years 10 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
HICSS
2002
IEEE
14 years 3 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
INFOCOM
2002
IEEE
14 years 3 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...