Compact routing schemes for bounded tree-length graphs and for κ- chor dal graphs

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

Volumn 3274, Issue , 2004, Pages 365-378

  Dourisboure, Yon ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Chordality; Compact routing; Tree decomposition; Tree length

Indexed keywords

FORESTRY; GRAPHIC METHODS; NETWORK ROUTING; POLYNOMIAL APPROXIMATION; ROUTING PROTOCOLS;

CHORDAL GRAPHS; CHORDALITY; COMPACT ROUTING; EFFICIENT ROUTING; POLYNOMIAL-TIME; ROUTING SCHEME; TREE DECOMPOSITION; TREE-LENGTH;

TREES (MATHEMATICS);

EID: 33646398046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_26     Document Type: Article

References (29)

1. st Symposium on Theory of Computing (STOC), vol. 2, May 1989, pp. 230-240.
2. _, Improved routing strategies with succinct tables, Journal of Algorithms, 11 (1990), pp. 307-341.
3. th Symposium on Foundations of Computer Science (FOGS), IEEE Computer Society Press, 1990, pp. 503513.
4. _, Routing with polynomial communication-space trade-off, SIAM Journal on Discrete Mathematics, 5 (1992), pp. 151-162.
5. V. D. CHEPOI AND F. F. DRAGAN, A note on distance approximating trees in graphs, Europ. J. Combinatorics, 21 (2000), pp. 761-768.
6. V. D. CHEPOI, F. F. DRAGAN, AND C. YAN, Additive spanner for k-chordal graphs, in Algorithms and Complexity: 5th Italian Conference (CIAC 2003), vol. 2653 of Lecture Notes in Computer Science, Springer-Verlag Heidelberg, May 2003, pp. 96107.
7. R. DIESTEL, Graph Theory (second edition), vol. 173 of Graduate Texts in Mathematics, Springer, Feb. 2000.
8. Y. DOURISBOURE, Routage compact et longueur arborescente, 2003. PhD Thesis, LaBRI, University of Bordeaux 1.
9. Y. DOURISBOURE AND C. GAVOILLE, Improved compact routing scheme for chordal graphs, in 16-th International Symposium on Distributed Computing (DISC 2002), vol. 2508 of Lecture Notes in Computer Science, Springer-Verlag, Oct. 2002, pp. 252-264.
10. _, Tree-decomposition of graphs with small diameter bags, in European conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2003), ITI, Sept. 2003, pp. 100-104.
11. th Scandinavian Workshop on Algorithm Theory (SWAT), 2004. To appear.
12. P. FRAIGNIAUD AND C. GAVOILLE, Universal routing schemes, Journal of Distributed Computing, 10 (1997), pp. 65-78.
13. _, Routing in trees, Research Report RR-1252-01, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, Jan. 2001. Sumitted.
14. G. N. FREDERICKSON AND R. JANARDAN, Efficient message routing in planar networks, SIAM Journal on Computing, 18 (1989), pp. 843-857.
15. _, Space-efficient message routing in c-decomposable networks, SIAM Journal on Computing, 19 (1990), pp. 164-181.
16. C. GAVOILLE, Routing in distributed networks: Overview and open problems, ACM SIGACT News - Distributed Computing Column, 32 (2001), pp. 36-52.
17. C. GAVOILLE AND M. GENGLER, Space-efficiency of routing schemes of stretch factor three, Journal of Parallel and Distributed Computing, 61 (2001), pp. 679687.
18. th International Colloquium on Automata, Languages and Programming (ICALP), J. Wiedermann, P. van Emde Boas, and M. Nielsen, eds., vol. 1644 of Lecture Notes in Computer Science, Springer, July 1999, pp. 351-360.
19. C. GAVOILLE, M. KATZ, N. A. KATZ, C. PAUL, AND D. PELEG, Approximate distance labeling schemes, Research Report RR-1250-00, LaBRI, University of Bordeaux, 351, cours de la Libération, 33405 Talence Cedex, France, Dec. 2000.
20. th Annual European Symposium on Algorithms (ESA), F. M. auf der Heide, ed., vol. 2161 of Lecture Notes in Computer Science, Springer, Aug. 2001, pp. 476-488.
21. th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM PRESS, May 1996, pp. 125-133.
22. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays Trees - Hypercubes, Morgan Kaufmann, 1992.
23. th Annual International Computing & Combinatorics Conference (COCOON), vol. 2387 of Lecture Notes in Computer Science, Springer, Aug. 2002, pp. 57-66.
24. D. PELEG, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications, 2000.
25. D. PELEG AND E. UPFAL, A trade-off between space and efficiency for routing tables, Journal of the ACM, 36 (1989), pp. 510-530.
26. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, 7 (1986), pp. 309-322.
27. th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Oct. 2001.
28. rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Crete, Greece, July 2001, pp. 183-192.
29. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Hersonissos, Crete, Greece, July 2001, ACM PRESS, pp. 1-10.