Tree spanners on chordal graphs: Complexity, algorithms, open problems

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

Volumn 2518 LNCS, Issue , 2002, Pages 163-174

  Brandstadt, A ^a   Dragan, F F ^b   Le, H O ^a   Le, V B ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHORDAL GRAPHS; HARDNESS RESULT; INTERVAL GRAPH; PATH GRAPHS; SPANNING TREE; SPLIT GRAPHS; STRONGLY CHORDAL GRAPH; TREE T-SPANNER; NP COMPLETE;

ALGORITHMS; GRAPHIC METHODS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

TREES (MATHEMATICS);

EID: 27844500584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_15     Document Type: Conference Paper

References (25)

1. B. Awerbuch, A. Baratz, D. Peleg, Efficient broadcast and light-weighted spanners, manuscript, 1992
2. H.-J. Bandelt, A. Dress, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math. 7 (1986) 309-343
3. A. Brandstädt, V. Chepoi, F. Dragan, Distance approximating trees for chordal and dually chordal graphs, J. Algorithms 30 (1999) 166-184 (Pubitemid 129608022)
4. A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl., (SIAM, Philadelphia, 1999)
5. L. Cai, Tree spanners: Spanning trees that approximate the distances, Ph. D. thesis, University of Toronto, 1992
6. L. Cai, D.G. Corneil, Tree spanners, SIAM J. Discrete. Math. 8 (1995) 359-387
7. L. Cai, D.G. Corneil, Tree spanners: An overview, Congressus Numer. 88 (1992) 65-76
8. G.J. Chang, G.L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM. J. Alg. Disc. Meth. 5 (1984) 332-345
9. V.D. Chepoi, Centers of triangulated graphs, Math. Notes 43 (1988) 82-86
10. V.D. Chepoi, F.F. Dragan, Linear-time algorithm for finding a center vertex of a chordal graph, Lecture Notes in Computer Science 855 (1994) 159-170
11. M. Farber, Characterizations of strongly chordal graphs, Discrete Math. 43 (1983) 173-189
12. S.P. Fekete, J. Kremer, Tree spanners in planar graphs, Discrete Appl. Math. 108 (2001) 85-103 (Pubitemid 33673481)
13. F. Gavril, The intersection graphs of subtrees in trees are exatly the chordal graphs, J. Combin. Theory (B) 16 (1974) 47-56
14. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980)
15. E. Howorka, A characterization of ptolemaic graphs, J. Graph Theory 5 (1981) 323-331
16. Hoàng-Oanh Le, Effiziente Algorithmen für Baumspanner in chordalen Graphen, Diploma thesis, Dept.of mathematics, technical university of Berlin, 1994
17. H.-O Le, V.B. Le, Optimal tree 3-spanners in directed path graphs, Networks 34 (1999) 81-87 (Pubitemid 129321128)
18. M.S. Madanlal, G. Venkatesan, C. Pandu Rangan, Tree 3-spanners on interval, permutation and regular bipartite graphs, Inform. Process. Lett. 59 (1996) 97-102 (Pubitemid 126375639)
19. I.E. Papoutsakis, Two structure theorems on tree spanners, M. Sc. thesis, Dept.of Computer Science, University of Toronto, 1999
20. I.E. Papoutsakis, On the union of two tree spanners of a graph, Preprint, 2001
21. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Math. Appl., (SIAM, Philadelphia, 2000)
22. D. Peleg, A. Schaeffer, Graph spanners, J. Graph Theory 13 (1989) 99-116
23. E. Prisner, Distance approximating spanning trees, in: Proc. STACS'97, Lecture Notes in Computer Science, Vol. 1200 (Springer, Berlin, 1997) 499-510 (Pubitemid 127044176)
24. J. Soares, Graph spanners: A survey, Congressus Numer. 89 (1992) 225-238
25. G. Venkatesan, U. Rotics, M.S. Madanlal, J.A. Makowsky, C. Pandu Ragan, Restrictions of minimum spanner problems, Information and Computation 136 (1997) 143-164 (Pubitemid 127454005)