Additive tree spanners

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 2, 2003, Pages 332-340

  Kratsch, Dieter ^a   Le, Hoàng Oanh ^b   Müller, Haiko ^c   Prisner, Erich ^d   Wagner, Dorothea ^e  

^a UNIVERSITÉ DE LORRAINE   (France)

^b UNIVERSITY OF ROSTOCK   (Germany)

^c UNIVERSITY OF LEEDS   (United Kingdom)

^d International Relations and Political Science   (Switzerland)

^e UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Algorithm; Asteroidal triple free graph; Chordal graph; Distance; Distance hereditary graph; Graph spanner; Spanning tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

ASTEROIDAL TRIPLE-FREE GRAPHS; CHORODAL GRAPHS; DISTANCE GRAPH SPANNERS; DISTANCE-HEREDITARY GRAPHS; SOANNING TREES;

TREES (MATHEMATICS);

EID: 2542454035     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480195295471     Document Type: Article

References (21)

1. H.-J. BANDELT AND H. M. MULDER, Distance-hereditary graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 182-208.
2. A. BRANDSTÄDT, V. CHEPOI, AND F. DRAGAN, Distance approximating trees for chordal and dually chordal graphs, J. Algorithms, 30 (1999), pp. 166-184.
3. L. CAI AND D. G. CORNEIL, Tree spanners: An overview, Congr. Numer., 88 (1992), pp. 65-76.
4. L. CAI AND D. G. CORNEIL, Tree spanners, SLAM J. Discrete Math., 8 (1995), pp. 359-387.
5. D. G. CORNEIL, S. OLARIU, AND L. STEWART, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput., 28 (1999), pp. 1284-1297.
6. D. G. CORNEIL, S. OLARIU, L. STEWART, Asteroidal triple-free graphs, SIAM J. Discrete Math., 10 (1997), pp. 399-430.
7. M. FARBER, Characterizations of strongly chordal graphs, Discrete Math., 43 (1983), pp. 173-189.
8. S. P. FEKETE AND J. KREMER, Tree spanners in planar graphs, in Graph-Theoretic Concepts in Computer Science, Lecture Notes in Comput. Sci. 1517, Springer, Berlin, 1998, pp. 298-309.
9. P. L. HAMMER AND F. MAFFRAY, Completely separable graphs, Discrete Appl. Math., 27 (1990), pp. 85-99.
10. T. KLOKS, D. KRATSCH, AND H. MÜLLER, Approximating the bandwidth for asteroidal triple-free graphs, J. Algorithms, 32 (1999), pp. 41-57.
11. HOÀNG-OANH LE, Effiziente Algorithmen für Baumspanner in chordalen Graphen, Diploma thesis, TU Berlin, Berlin, 1994.
12. HOÀNG-OANH LE AND VAN BANG LE, Optimal tree 3-spanners in directed path graphs, Networks, 34 (1999), pp. 81-87.
13. C. LEKKERKERKER AND J. BOLAND, Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), pp. 45-64.
14. A. L. LIESTMAN AND T. SHERMER, Additive graph spanners, Networks, 23 (1993), pp. 343-364.
15. M. S. MADANLAL, G. VANKATESAN, AND C. PANDU RANGAN, Tree 3-spanners on interval, permutation and regular bipartite graphs, Inform. Process. Lett., 59 (1996), pp. 97-102.
16. T. A. MCKEE, personal communication to E. Prisner, 1995.
17. D. PELEG AND A. A. SCHÄFFER, Graph spanners, J. Graph Theory, 13 (1989), pp. 99-116.
18. D. PELEG AND J. D. ULLMAN, An optimal synchronizer for the hypercube, in Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 77-85.
19. E. PRISNER, Distance approximating spanning trees, in STACS 97, Lecture Notes in Comput. Sci. 1200, Springer-Verlag, Berlin, 1997, pp. 499-510.
20. J. SOARES, Graph spanners: A survey, Congr. Numer., 89 (1992), pp. 225-238.
21. G. VENKATESAN, U. ROTICS, M. S. MADANLAL, J. A. MAKOWSKY, AND C. PANDU RANGAN, Restrictions of minimum spanner problems, Inform, and Comput., 136 (1997), pp. 143-164.