Additive spanners for k-chordal graphs

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

Volumn 2653, Issue , 2003, Pages 96-107

  Chepoi, Victor D ^a   Dragan, Feodor F ^b   Yan, Chenyu ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Algorithms; Sparse Graph Spanners

Indexed keywords

COMPUTATIONAL COMPLEXITY;

ADDITIVE SPANNERS; CHORDAL GRAPHS; INDUCED CYCLE; LINEAR TIME;

GRAPH THEORY;

EID: 33847617980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_16     Document Type: Article

References (24)

1. I. ALTHÖFER, G. DAS, D. DOBKIN, D. JOSEPH, and J. SOARES, On sparse spanners of weighted graphs, Discrete Comput. Geom., 9 (1993), 81-100.
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 AND F. DRAGAN. Distance Approximating Trees for Chordal and Dually Chordal Graphs, Journal of Algorithms, 30 (1999), 166-184.
4. A. BRANDSTÄDT, F.F. DRAGAN, H.-O. LE, AND V.B. LE, Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems, to appear in the Proceedings of ISAAC 2002.
5. U. BRANDES and D. HANDKE, NP-Completeness Results for Minimum Planar Spanners, Preprint University of Konstanz, Konstanzer Schriften in Mathematik und Informatik, Nr. 16, Oktober 1996.
6. L. CAI, Tree spanners: Spanning trees that approximate the distances, Ph.D. thesis, University of Toronto, 1992.
7. L. CAI AND D.G. CORNEIL, Tree spanners, SIAM J. Disc. Math., 8 (1995), 359-387.
8. V. CHEPOI AND F. DRAGAN, A Note on Distance Approximating Trees in Graphs, Europ. J. Combinatorics, 21 (2000) 761-766.
9. F.F. DRAGAN, Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach (extended abstract), Proc. 27th International Workshop "Graph-Theoretic Concepts in Computer Science"(WG'01), June 2001, Springer, Lecture Notes in Computer Science 2204, pp. 103-116.
10. S.P. FEKETE, J. KREMER, Tree spanners in planar graphs, Discrete Appl. Math. 108 (2001) 85-103.
11. J.R. GILBERT, D.J. ROSE, AND A. EDENBRANDT, A separator theorem for chordal graphs, SIAM J. Alg. Discrete Math., 5 (1984) 306-313.
12. M.C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
13. H.-O. LE, Effiziente Algorithmen für Baumspanner in chordalen Graphen, Diploma thesis, Dept. of mathematics, technical university of Berlin, 1994.
14. H.-O. LE, V.B. LE, Optimal tree 3-spanners in directed path graphs, Networks 34 (1999) 81-87.
15. A.L. LIESTMAN AND T. SHERMER, Additive graph spanners, Networks, 23 (1993), 343-364.
16. M.S. MADANLAL, G. VENKATESAN AND C. PANDU RANGAN, Tree 3-spanners on interval, permutation and regular bipartite graphs, Information Processing Letters, 59 (1996), 97-102.
17. I.E. PAPOUTSAKIS, On the union of two tree spanners of a graph, Preprint, 2001.
18. D. PELEG, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Math. Appl., (SIAM, Philadelphia, 2000).
19. D. PELEG AND A. A. SCHAFFER, Graph Spanners, Journal of Graph Theory, 13 (1989), 99-116.
20. D. PELEG AND J.D. ULLMAN, An optimal synchronizer for the hypercube, in Proc. 6th ACM Symposium on Principles of Distributed Computing, Vancouver, 1987, 77-85.
21. D. PELEG AND E. UPFAL, A tradeoff between space and efficiency for routing tables. 20th ACM Symposium on the Theory of Computing, Chicago (1988), 43-52.
22. E. PRISNER, Distance approximating spanning trees, in Proc. of STACS'97, Lecture Notes in Computer Science 1200, (R. Reischuk and M. Morvan, eds.), Springer-Verlag, Berlin, New York, 1997, 499-510.
23. E. PRISNER, H.-O. LE, H. MÜLLER AND D. WAGNER, Additive tree spanners, to appear in SIAM Journal on Discrete Mathematics.
24. J. SOARES, Graph spanners: A survey, Congressus Numer. 89 (1992) 225-238.