24 search results - page 5 / 5 » Augmenting the Connectivity of Planar and Geometric Graphs |
ICDCSW
2009
IEEE
14 years 13 days ago
2009
IEEE
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
DCG
2007
13 years 5 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
SIGMETRICS
2006
ACM
13 years 11 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
DAGSTUHL
2001
13 years 7 months ago
2001
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...