Improved compact routing scheme for chordal graphs

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

Volumn 2508, Issue , 2002, Pages 252-264

  Dourisboure, Yon ^a   Gavoille, Cyril ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Chordal graph; Compact routing tables; Tree decomposition

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; NETWORK ROUTING; POLYNOMIAL APPROXIMATION; ROUTING PROTOCOLS;

CHORDAL GRAPHS; COMPACT ROUTING; COMPACT ROUTING TABLES; POLYNOMIAL-TIME; ROUTING SCHEME; ROUTING TABLE; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 84947206152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36108-1_17     Document Type: Conference Paper

References (31)

1. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Compact distributed data structures for adaptive routing. In 21st Symposium on Theory of Computing (STOC), volume 2, pages 230-240, May 1989.
2. Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307-341, September 1990.
3. Baruch Awerbuch and David Peleg. Sparse partitions. In 31th Symposium on Foundations of Computer Science (FOCS), pages 503-513. IEEE Computer SocietyPress, 1990.
4. Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics, 5(2):151-162, May 1992.
5. Stephen Alstrup and Theis Rauhe. Improved labeling scheme for ancestor queries. In 13th Symposium on Discrete Algorithms (SODA). ACMSIAM, January 2001. To appear.
6. Andreas Brandst¨adt, Victor Chepoi, and Feodor Dragan. Distance approximating trees for chordal and duallyc hordal graphs. Journal of Algorithms, 30:166-184, 1999.
7. Reinhard Diestel. Graph Theory (second edition), volume 173 of Graduate Texts in Mathematics. Springer, February2000.
8. Yon Dourisboure. An additive stretched routing scheme for chordal graphs. In 28-th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’02), June 2002. To appear.
9. Pierre Fraigniaud and Cyril Gavoille. Universal routing schemes. Journal of Distributed Computing, 10:65-78, 1997
10. Pierre Fraigniaud and Cyril Gavoille. Routing in trees. In Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen, editors, 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757-772. Springer, July 2001.
11. Greg N. Frederickson and Ravi Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843-857, August 1989.
12. Greg N. Frederickson and Ravi Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19(1):164-181, February 1990.
13. Cyril Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News-Distributed Computing Column, 32(1), March 2001. To appear.
14. Cyril Gavoille and Marc Gengler. Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing, 61:679-687, 2001.
15. Cyril Gavoille and Nicolas Hanusse. Compact routing tables for graphs of bounded genus. In Jiří Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of Lecture Notes in Computer Science, pages 351-360. Springer, July 1999.
16. Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, and David Peleg. Approximate distance labeling schemes. Research Report RR-1250-00, LaBRI, Universityof Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, December 2000.
17. Cyril Gavoille and Stéphane Pérennès. Memoryrequiremen t for routing in distributed networks. In 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 125-133. ACM PRESS, May 1996.
18. Haim Kaplan and Tova Milo. Short and simple labels for small distances and other functions. In 7th International Workshop on Algorithms and Data Structures (WADS), volume 2125 of Lecture Notes in Computer Science, pages 32-40. Springer, August 2001.
19. Haim Kaplan, Tova Milo, and Ronen Shabo. A comparison of labeling schemes for ancestor queries. In 14th Symposium on Discrete Algorithms (SODA). ACM-SIAM, January 2002.
20. Frank Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes. Morgan Kaufmann, 1992.
21. Hsueh-I Lu. Improved comact routing tabels for planar networks via orderlyspanning trees. In 8th Annual International Computing & Combinatorics Conference (COCOON), volume Lectures Notes in Computer Science. Springer, August 2002.
22. Lata Narayanan and Naomi Nishimura. Interval routing on k-trees. Journal of Algorithms, 26(2):325-369, February 1998.
23. David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
24. David Peleg. Informative labeling schemes for graphs. In 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1893 of Lecture Notes in Computer Science, pages 579-588. Springer, August 2000.
25. Erich Prisner. Distance approximating spanning trees. In 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1200 of Lecture Notes in Computer Science, pages 499-510. Springer, 1997.
26. David Peleg and Alejandro A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99-116, 1989.
27. David Peleg and Eli Upfal. A trade-off between space and efficiencyfor routing tables. Journal of the ACM, 36(3):510-530, July 1989.
28. Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
29. Mikkel Thorup. Compact oracles for reachabilityand approximate distances in planar digraphs. In 42th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer SocietyPress, October 2001.
30. Mikkel Thorup and Uri Zwick. Approximate distance oracles. In 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 183-192, Hersonissos, Crete, Greece, July 2001.
31. Mikkel Thorup and Uri Zwick. Compact routing schemes. In 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1-10, Hersonissos, Crete, Greece, July 2001. ACM PRESS.