Sparse additive spanners for bounded tree-length graphs

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

Volumn 3104, Issue , 2004, Pages 123-137

  Dourisboure, Yon ^a   Gavoille, Cyril ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Additive spanner; Chordality; Tree decomposition; Tree length

Indexed keywords

FORESTRY; GRAPH THEORY; GRAPHIC METHODS;

ADDITIVE SPANNERS; CHORDAL GRAPHS; CHORDALITY; LOWER BOUNDS; N-VERTEX GRAPH; TREE DECOMPOSITION; TREE-LENGTH; UPPER BOUND;

TREES (MATHEMATICS);

EID: 34548046135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27796-5_12     Document Type: Article

References (27)

1. Noga Alon, Shlomo Hoory, and Nathan Linial. The Moore bound for irregular graphs. Graph and Combinatorics, 18(1):53-57, 2002.
2. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993.
3. th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of LNCS, pages 384-396. Springer, July 2003.
4. Hans Leo Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305-1317, 1996.
5. Ulrik Brandes and Dagmar Handke. NP-completeness results for minimum planar spanners. Discrete Mathematics & Theoretical Computer Science, 3(1):1-10, 1998.
6. Andreas Brandstädt, Feodor F. Dragan, H.-O. Le, and Van Bang Le. Tree spanners on chordal graphs: Complexity and algorithms. Theoretical Computer Science, 310:329-354, 2004.
7. Leizhen Cai and Derek G. Corneil. Tree spanners. SIAM Journal on Discrete Mathematics, 8(3):359-387, 1995.
8. th International Conference on Graph Theory (ICGT). Electronical Notes in Discrete Mathematics, August 2000.
9. th Italian Conference on Algorithms and Complexity (CIAC), volume 2653 of LNCS, pages 96-107. Springer, May 2003.
10. Reinhard Diestel. Graph Theory (second edition), volume 173 of Graduate Texts in Mathematics. Springer, February 2000.
11. th Annual ACM Symposium on Theory of Computing (STOC), pages 750-759, 1999.
12. Dorit Dor, Shay Halperin, and Uri Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29:1740-1759, 2000.
13. Yon Dourisboure. Routage compact et longueur arborescente. PhD thesis, Université Bordeaux 1, Talence, France, December 2003.
14. Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, and Chenyu Yan. Improved spanners for bounded tree-length graphs, 2004. In preparation.
15. nd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), pages 100-104, September 2003.
16. rd Annual ACM Symposium on Theory of Computing (STOC), pages 173-182, July 2001.
17. Paul Erdös. Extremal problems in graph theory. In Publ. House Cszechoslovak Acad. Sci., Prague, pages 29-36, 1964.
18. Sándor P. Fekete and Jana Kremer. Tree spanners in planar graphs. Discrete Applied Mathematics, 108:85-103, 2001.
19. th Annual European Symposium on Algorithms (ESA), volume 2161 of LNCS, pages 476-488. Springer, August 2001.
20. M.S. Madanlal, G. Venkatesan, and C. Pandu Rangan. Tree 3-spanners on interval, permutation and regular bipartite graphs. Information Processing Letters, 59(2):97-102, 1996.
21. David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
22. David Peleg and Alejandro A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99-116, 1989.
23. David Peleg and Jeffrey D. Ullman. An optimal synchornizer for the hypercube. SIAM Journal on Computing, 18:740-747, 1989.
24. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510-530, July 1989.
25. Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
26. José Soares. Graphs spanners: A survey. Congressus Numerantium, 89:225-238, 1992.
27. rd Annual ACM Symposium on Theory of Computing (STOC), pages 183-192, July 2001.