How to use spanning trees to navigate in graphs (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5734 LNCS, Issue , 2009, Pages 282-294

  Dragan, Feodor F ^a   Xiang, Yang ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; CONSTANT FACTORS; EXTENDED ABSTRACTS; GLOBAL INFORMATIONS; GRAPH G; HYPERBOLICITY; INDUCED CYCLE; ROUTING PATH; SPANNING TREE;

COMPUTER SCIENCE; NAVIGATION;

GRAPH THEORY;

EID: 70349329529     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_25     Document Type: Conference Paper

References (31)

1. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. In: 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communic., pp. 48-55. ACM Press, New York (1999)
2. Brandstädt, A., Dragan, F.F., Chepoi, V.D., Voloshin, V.I.: Dually chordal graphs. SIAM J. Discrete Math. 11, 437-455 (1998)
3. Brandstädt, A., Bang Le, V., Spinrad, J.P.: Graph Classes: A Survey, Philadelphia. SIAM Monographs on Discrete Mathematics and Applications (1999)
4. Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers, and approximating trees of d-hyperbolic geodesic spaces and graphs. In: SoCG 2008, pp. 59-68 (2008)
5. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Mathematics 307, 2008-2029 (2007)
6. Dragan, F.F., Matamala, M.: Navigating in a graph by aid of its spanning tree. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.5369, pp. 788-799. Springer, Heidelberg (2008)
7. Dragan, F.F., Xiang, Y.: How to use spanning trees to navigate in graphs, full version, http://www.cs.kent.edu/dragan/MFCS2009-journal.pdf
8. Fonseca, R., Ratnasamy, S., Zhao, J., Ee, C.T., Culler, D., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point routing in wireless sensornets. In: 2nd USENIX/ACM Symp. on Networked Systems Design and Implementation (2005)
9. Fraigniaud, P.: Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.4698, pp. 2-11. Springer, Heidelberg (2007)
10. Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: SPAA 2007, 154-160 (2007)
11. Garg, V.K., Agarwal, A.: Distributed maintenance of a spanning tree using labeled tree encoding. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.3648, pp. 606-616. Springer, Heidelberg (2005)
12. Gartner, F.C.: A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms, Technical Report IC/2003/38, Swiss Federal Institute of Technology (EPFL) (2003)
13. Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column 32 (2001)
14. Gavoille, C., Peleg, D., Pérennès, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53, 85-112 (2004)
15. Giordano, S., Stojmenovic, I.: Position based routing algorithms for ad hoc networks: A taxonomy. In: Ad Hoc Wireless Networking, pp. 103-136. Kluwer, Dor-drecht (2004)
16. Gromov, M.: Hyperbolic Groups. In: Gersten, S.M. (ed.) Essays in group theory.MSRI Series, vol.8, pp. 75-263 (1987)
17. Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and bicon-nectivity. J. ACM 48(4), 723-760 (2001)
18. Jacquet, P., Viennot, L.: Remote spanners: what to know beyond neighbors. In: IPDPS 2009, pp. 1-15 (2009)
19. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: 6th ACM/IEEE MobiCom., pp. 243-254. ACM Press, New York (2000)
20. Kleinberg, J.M.: The small-world phenomenon: an algorithm perspective. In: STOC 2000, pp. 163-170. ACM, New York (2000)
21. Kleinberg, R.: Geographic routing using hyperbolic space. In: INFOCOM 2007, pp. 1902-1909 (2007)
22. Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC, pp. 63-72. ACM, New York (2003)
23. Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. PNAS 102, 11623-11628 (2005)
24. Linial, N., London, E., Rabinovich, Y.: The Geometry of Graphs and Some of its Algorithmic Applications. Combinatorica 15, 215-245 (1995)
25. Peleg, D.: Proximity-Preserving Labeling Schemes and Their Applications. J. of Graph Theory 33, 167-176 (2000)
26. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Math. Appl. SIAM, Philadelphia (2000)
27. Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographical routing without location information. In: Proceedings of MobiCom 2003, pp. 96-108 (2003)
28. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309-322 (1986)
29. Santoro, N., Khatib, R.: Labelling and Implicit Routing in Networks. The Computer Journal 28(1), 5-8 (1985)
30. Shavitt, Y., Tankel, T.: On internet embedding in hyperbolic spaces for overlay construction and distance estimation. In: INFOCOM 2004 (2004)
31. Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Ann. ACM Symp. on Par. Alg. and Arch., July 2001, pp. 1-10 (2001)