Spanners for bounded tree-length graphs

Theoretical Computer Science

Volumn 383, Issue 1, 2007, Pages 34-44

  Dourisboure, Yon ^a   Dragan, Feodor F ^b   Gavoille, Cyril ^a   Yan, Chenyu ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Additive spanner; Chordality; Tree decomposition; Tree length

Indexed keywords

BOUNDARY CONDITIONS; THEOREM PROVING;

ADDITIVE SPANNER; TREE-DECOMPOSITION; TREE-LENGTH;

TREES (MATHEMATICS);

EID: 34548025854     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.058     Document Type: Article

References (34)

1. Dourisboure Y., and Gavoille C. Sparse additive spanners for bounded tree-length graphs. 11th International Colloquium on Structural Information & Communication Complexity (SIROCCO). Lecture Notes in Computer Science vol. 3104 (2004), Springer 123-137
2. Dragan F.F., Yan C., and Lomonosov I. Collective tree spanners of graphs. In: Hagerup T., and Katajainen J. (Eds). 9th Scandinavian Workshop on Algorithm Theory. SWAT. Lecture Notes in Computer Science vol. 3111 (2004), Springer 64-76
3. Peleg D., and Ullman J.D. An optimal synchronizer for the hypercube. SIAM Journal on Computing 18 (1989) 740-747
4. Peleg D. Distributed computing: A locality-sensitive approach. SIAM Monographs on Discrete Mathematics and Applications (2000)
5. Peleg D., and Upfal E. A trade-off between space and efficiency for routing tables. Journal of the ACM 36 3 (1989) 510-530
6. Peleg D., and Schäffer A.A. Graph spanners. Journal of Graph Theory 13 1 (1989) 99-116
7. Brandstädt A., Dragan F.F., Le H.-O., and Le V.B. Tree spanners on chordal graphs: Complexity and algorithms. Theoretical Computer Science 310 (2004) 329-354
8. Brandes U., and Handke D. NP-completeness results for minimum planar spanners. Discrete Mathematics & Theoretical Computer Science 3 1 (1998) 1-10
9. Cai L., and Corneil D.G. Tree spanners. SIAM Journal on Discrete Mathematics 8 3 (1995) 359-387
10. Y. Dodis, S. Khanna, Designing networks with bounded pairwise distance, in: 30th Annual ACM Symposium on Theory of Computing, STOC, 1999, pp. 750-759
11. Fekete S.P., and Kremer J. Tree spanners in planar graphs. Discrete Applied Mathematics 108 (2001) 85-103
12. Aingworth D., Chekuri C., Indyk P., and Motwani R. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing 28 4 (1999) 1167-1181
13. Dor D., Halperin S., and Zwick U. All-pairs almost shortest paths. SIAM Journal on Computing 29 (2000) 1740-1759
14. Elkin M., and Peleg D. (1 + ε{lunate}, β)-spanner constructions for general graphs. 33rd Annual ACM Symposium on Theory of Computing. STOC (2001), Hersonissos, Crete, Greece 173-182
15. Baswana S., Kavitha T., Mehlhorn K., and Pettie S. New constructions of (α, β)-spanners and purely additive spanners. 16th Symposium on Discrete Algorithms. SODA (2005), ACM-SIAM 672-681
16. Althöfer I., Das G., Dobkin D., Joseph D., and Soares J. On sparse spanners of weighted graphs. Discrete & Computational Geometry 9 1 (1993) 81-100
17. Thorup M., and Zwick U. Approximate distance oracles. 33rd Annual ACM Symposium on Theory of Computing. STOC (2001), Hersonissos, Crete, Greece 183-192
18. 1 + 1 / k) size in weighted graphs. 30th International Colloquium on Automata, Languages and Programming. ICALP. Lecture Notes in Computer Science vol. 2719 (2003), Springer 384-396
19. Alon N., Hoory S., and Linial N. The Moore bound for irregular graphs. Graph and Combinatorics 18 1 (2002) 53-57
20. P. Erdös, Extremal problems in graph theory, in: Publ. House Czechoslovak Acad. Sci., Prague, 1964, pp. 29-36
21. 10's. Journal of Combinatorial Theory, Series B 52 1 (1991) 113-116
22. Kratsch D., Le H.-O., Müller H., Prisner E., and Wagner D. Additive tree spanners. SIAM Journal on Discrete Mathematics 17 2 (2004) 332-340
23. Madanlal M., Venkatesan G., and Pandu Rangan C. Tree 3-spanners on interval, permutation and regular bipartite graphs. Information Processing Letters 59 2 (1996) 97-102
24. Soares J. Graphs spanners: A survey. Congressus Numerantium 89 (1992) 225-238
25. Chepoi V.D., Dragan F.F., and Yan C. Additive sparse spanners for graphs with bounded length of largest induced cycle. Theoretical Computer Science 347 (2005) 54-75
26. Robertson N., and Seymour P.D. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
27. Y. Dourisboure, C. Gavoille, Tree-decomposition of graphs with small diameter bags, in: J. Fila (Ed.), 2nd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), 2003, pp. 100-104
28. Y. Dourisboure, Routage compact et longueur arborescente, Ph.D. Thesis, Université Bordeaux 1, Talence, France, Dec. 2003
29. Y. Dourisboure, C. Gavoille, Small diameter bag tree-decompositions, Research Report RR-1326-04, LaBRI, University of Bordeaux 1, Discrete Mathematics (in press)
30. Diestel R. Graph Theory. second edition. Graduate Texts in Mathematics vol. 173 (2000), Springer
31. Gavoille C., Katz M., Katz N.A., Paul C., and Peleg D. Approximate distance labeling schemes. In: auf der Heide F.M. (Ed). 9th Annual European Symposium on Algorithms. ESA. Lecture Notes in Computer Science vol. 2161 (2001), Springer 476-488
32. Bodlaender H.L. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25 (1996) 1305-1317
33. Gavril F. Algorithms for maximum weight induced paths. Information Processing Letters 81 4 (2002) 203-208
34. Chepoi V.D., and Dragan F.F. A note on distance approximating trees in graphs. European Journal of Combinatorics 21 (2000) 761-768