9 search results - page 2 / 2 » On Convex Greedy Embedding Conjecture for 3-Connected Planar... |
INFOCOM
2011
IEEE
12 years 8 months ago
2011
IEEE
—In this paper we address the problem of scalable and load balanced routing for wireless sensor networks. Motivated by the analog of the continuous setting that geodesic routing ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
DCG
2011
13 years 1 days ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
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 ...