Optimal tree 3-spanners in directed path graphs

Networks

Volumn 34, Issue 2, 1999, Pages 81-87

  Le, Hoàng Oanh ^a   Le, Van Bang ^b  

^a Universität Rostock ^*  (Germany)

^b UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033196631     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199909)34:2<81::AID-NET1>3.0.CO;2-P     Document Type: Article

References (14)

1. [1] B. Awerbuch, A. Baratz, and D. Peleg, Efficient broadcast and light-weighted spanners, manuscript, 1992.
2. [2] A. Brandstädt, V. Chepoi, and F. Dragan, Distance approximating trees for chordal and dually chordal graphs, J. Algorithms 30 (1999), 166-184.
3. [3] L. Cai and D.G. Cornell, Tree spanners: An overview, Congres Numer 88 (1992), 65-76.
4. [4] L. Cai and D.G. Corneil, Tree spanners, SIAM J Discr Math 8 (1995), 395-387.
5. [5] P.F. Dietz, Intersection graph algorithms, Ph.D. Thesis, Comp. Sci. Dept., Cornell University, Ithaca, NY, 1984.
6. [6] F. Gavril, A recognition algorithm for the intersection graph of directed paths in directed trees, Discr Math 13 (1975), 237-249.
7. [7] F. Gavril, A recognition algorithm for the intersection graph of paths in a tree, Discr Math 23 (1978), 211-227.
8. [8] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
9. [9] J.E. Hopcroft and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J Comput 2 (1973), 135-158.
10. [10] H.-O. Le, Effiziente Algorithmen für Baumspanner in chordalen Graphen, Diploma Thesis, Dept. of Mathematics, Technical University of Berlin, 1994.
11. [11] M.S. Madanlal, G. Vankatesan, and C. Pandu Rangan, Tree 3-spanners on interval, permutation and regular bipartite graphs, Inf Process Lett 59 (1996), 97-102.
12. [12] D. Peleg and A. Schaeffer, Graph spanners, J Graph Theory 13 (1989), 99-116.
13. [13] E. Prisner, Distance approximating spanning trees, Proc. STACS'97, Lecture Notes in Computer Science, Vol. 1200, Springer, Berlin, 1997, pp. 499-510.
14. [14] J. Scares, Graph spanners: A survey, Congres Numer 89 (1992), 225-238.