Some Results on Greedy Embeddings in Metric Spaces

Discrete and Computational Geometry

Volumn 44, Issue 3, 2010, Pages 686-705

  Leighton, Tom ^a   Moitra, Ankur ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Christmas cactus graph; Excluded minor; Greedy embedding; Papadimitriou Ratajczak conjecture

Indexed keywords

EID: 77955769049     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9227-6     Document Type: Article

References (10)

1. Barnette, D.: Trees in polyhedral graphs. Can. J. Math. 18, 731-736 (1966).
2. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7, 609-616 (2001).
3. Dhandapani, R.: Greedy drawings of triangulations. In: Symposium on Discrete Algorithms, pp. 102-111 (2008).
4. Eppstein, D., Goodrich, M. T.: Succinct greedy graph drawing in the hyperbolic plane. In: Graph Drawing, pp. 14-25 (2008).
5. Gao, Z., Richter, R.: 2-walks in circuit graphs. J. Comb. Theory Ser. B 62, 259-267 (1994).
6. 2. In: CoRR (2008).
7. Karp, B., Kung, H. T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243-254 (2000).
8. Kleinberg, R.: Geographic routing in hyperbolic space. In: INFOCOM 2007, 26th IEEE Conference on Computer Communications, pp. 1902-1909 (2007).
9. Papadimitriou, C., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 244, 3-14 (2005).
10. Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 96-108 (2003).