LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem

Discrete Applied Mathematics

Volumn 98, Issue 3, 2000, Pages 191-207

  Dragan, Feodor F ^a   Nicolai, Falk ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b D 46045   (Germany)

Author keywords

Diameter; Distance hereditary graphs; LexBFS ordering; Linear time algorithm; Metric power; Perfect elimination ordering

Indexed keywords

EID: 0344323964     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00157-2     Document Type: Article

References (18)

1. Bandelt H.J., Henkmann A., Nicolai F. Powers of distance-hereditary graphs. Discrete Math. 145:1995;37-60.
2. Bandelt H.-J., Mulder H.M. Distance-hereditary graphs. J. Combin. Theory (B). 41:1986;182-208.
3. Bandelt H.-J., Mulder H.M. Pseudo-modular graphs. Discrete Math. 62:1986;245-260.
4. Brandstädt A., Chepoi V.D., Dragan F.F. Perfect elimination orderings of chordal powers of graphs. Discrete Math. 158:1996;273-278.
5. Brandstädt A., Dragan F.F., Nicolai F. LexBFS-orderings and powers of chordal graphs. Discrete Math. 171:1997;27-42.
6. d'Atri A., Moscarini M. Distance-hereditary graphs, Steiner trees and connected domination. SIAM J. Comput. 17:1988;521-538.
7. F.F. Dragan, Dominating cliques in distance-hereditary graphs, Proceedings of SWAT'94, Springer Lecture Notes in Computer Science, vol. 824, pp. 370-381.
8. Dragan F.F., Nicolai F., Brandstädt A. Convexity and HHD-free graphs. SIAM J. Discrete Math. 12:1999;119-135.
9. F.F. Dragan, C.F. Prisacaru, V.D. Chepoi, Location problems in graphs and the Helly property, Discrete Math. Moscow 4 (1992) 67-73 (in Russian).
10. Duchet P. Classical perfect graphs. Ann. Discrete Math. 21:1984;67-96.
11. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
12. Hammer P.L., Maffray F. Completely separable graphs. Discrete Appl. Math. 27:1990;85-99.
13. Howorka E. A characterization of distance-hereditary graphs. Quart. J. Math. Oxford Ser. 2(28):1977;417-420.
14. Jamison B., Olariu S. On the semi-perfect elimination. Adv. App. Math. 9:1988;364-376.
15. F. Nicolai, A hypertree characterization of distance-hereditary graphs, Technical Report Gerhard-Mercator-Universität-Gersamthochule Duisburg SM-DU-255, 1994.
16. F. Nicolai, Hamiltonian problems on distance-hereditary graphs, Technical Report Gerhard-Mercator-Universität-Gersamthochule Duisburg SM-DU-264, 1994.
17. Olariu S. Some aspects of semi-perfect elimination. Disc. Appl. Math. 31:1991;291-298.
18. Rose D., Tarjan R.E., Lueker G. Algorithmic aspects on vertex elimination on graphs. SIAM J. Comput. 5:1976;266-283.