4865 search results - page 105 / 973 » The Complexity of Graph Connectivity |
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
TROB
2008
13 years 10 months ago
2008
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
ESA
1997
Springer
14 years 2 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
GECCO
2000
Springer
14 years 2 months ago
2000
Springer
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
HYBRID
2009
Springer
14 years 5 months ago
2009
Springer
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...