Tree spanners on chordal graphs: Complexity and algorithms

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 329-354

  Brandstädt, Andreas ^a   Dragan, Feodor F ^b   Le, Hoàng Oanh ^a   Le, Van Bang ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Chordal graphs; Distance; Efficient graph algorithms; NP completeness; Spanners; Spanning trees; Tree spanners

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; THEOREM PROVING;

SPANNING TREES;

TREES (MATHEMATICS);

EID: 0242608579     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00424-9     Document Type: Article

References (32)

1. B. Awerbuch, A. Baratz, D. Peleg, Efficient broadcast and light-weighted spanners, manuscript, 1992.
2. Bandelt H.-J., Dress A. Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7:1986;309-343.
3. Brandstädt A., Chepoi V., Dragan F. Distance approximating trees for chordal and dually chordal graphs. J. Algorithms. 30:1999;166-184.
4. A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications SIAM, Philadelphia, 1999.
5. Buneman P. A characterization of rigid circuit graphs. Discrete Math. 9:1974;48-50.
6. L. Cai, Tree spanners: spanning trees that approximate the distances, Ph.D. Thesis, University of Toronto, 1992.
7. Cai L., Corneil D.G. Tree spanners. an overview Congressus Numer. 88:1992;65-76.
8. Cai L., Corneil D.G. Tree spanners. SIAM J. Discrete. Math. 8:1995;359-387.
9. Chang G.J., Nemhauser G.L. The. k -domination and k -stability problems on sun-free chordal graphs SIAM. J. Alg. Disc. Meth. 5:1984;332-345.
10. Chepoi V.D. Centers of triangulated graphs. Math. Notes. 43:1988;82-86.
11. V.D. Chepoi, F.F. Dragan, Linear-time algorithm for finding a center vertex of a chordal graph, Lecture Notes in Computer Science, Vol. 855, Springer, Berlin, 1994, pp. 159-170.
12. E. Dahlhaus, Chordale Graphen in besonderem Hinblick auf parallele Algorithmen, Habilitation Thesis, Universität Bonn, 1991.
13. F.F. Dragan, A. Brandstädt, r - Dominating cliques in Helly graphs and chordal graphs, Proc. of the 11th STACS, Caen, France, Springer, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 735-746; Discrete Math. 162 (1996) 93-108.
14. F.F. Dragan, A. Brandstädt, r - Dominating cliques in Helly graphs and chordal graphs, Proc. of the 11th STACS, Caen, France, Springer, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 735-746; Discrete Math. 162 (1996) 93-108.
15. Farber M. Characterizations of strongly chordal graphs. Discrete Math. 43:1983;173-189.
16. Farber M., Jamison R.E. Convexity in graphs and hypergraphs. SIAM J. Alg. Discr. Meth. 7:1986;433-444.
17. Fekete S.P., Kremer J. Tree spanners in planar graphs. Discrete Appl. Math. 108:2001;85-103.
18. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory (B). 16:1974;47-56.
19. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
20. Hoàng-Oanh Le, Effiziente Algorithmen für Baumspanner in chordalen Graphen, Diploma Thesis, Department of Mathematics, Technical University of Berlin, 1994.
21. Le H.-O, Le V.B. Optimal tree 3-spanners in directed path graphs. Networks. 34:1999;81-87.
22. Howorka E. A characterization of ptolemaic graphs. J. Graph Theory. 5:1981;323-331.
23. Madanlal M.S., Venkatesan G., Pandu Rangan C. Tree 3-spanners on interval, permutation and regular bipartite graphs. Inform. Process. Lett. 59:1996;97-102.
24. I.E. Papoutsakis, Two structure theorems on tree spanners, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1999.
25. I.E. Papoutsakis, On the union of two tree spanners of a graph, Sixth Internat. Conf. on Graphs Theory Marseilles, France, August 28-September 1, 2000.
26. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Application, SIAM, Philadelphia, 2000.
27. Peleg D., Schaeffer A. Graph spanners. J. Graph Theory. 13:1989;99-116.
28. E. Prisner, Distance approximating spanning trees, in: Proc. STACS'97, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 99-510.
29. Soares J. Graph spanners. a survey Congressus Numer. 89:1992;225-238.
30. Venkatesan G., Rotics U., Madanlal M.S., Makowsky J.A., Pandu Ragan C. Restrictions of minimum spanner problems. Inform. Comput. 136:1997;143-164.
31. V.I. Voloshin, On properties of triangulated graphs, Oper. Res. Prog. (Kishinev), (1982) 24-32, (in Russian).
32. J.R. Walter, Representations of rigid cycle graphs, Ph.D. Thesis, Wayne State University, Detroit, 1972.