Almost diameter of a house-hole-free graph in linear time via LexBFS

Discrete Applied Mathematics

Volumn 95, Issue 1-3, 1999, Pages 223-239

  Dragan, Feodor F ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

AT free graphs; Diameter; Eccentricity; House hole domino free graphs; House hole free graphs; LexBFS; Linear time algorithm

Indexed keywords

EID: 0043280974     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00077-3     Document Type: Article

References (23)

1. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of WG'94 "Graph-Theoretic Concepts in Computer Science", Lecture Notes in Computer Science, vol. 903, 1995, pp. 65-80, Discrete Appl. Math. 82 (1998) 43-77.
2. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of WG'94 "Graph-Theoretic Concepts in Computer Science", Lecture Notes in Computer Science, vol. 903, 1995, pp. 65-80, Discrete Appl. Math. 82 (1998) 43-77.
3. A. Brandstädt, F.F. Dragan, F. Nicolai, LexBFS-orderings and powers of chordal graphs, Discrete Math. 171 (1997) 27-42.
4. V.D. Chepoi, On distances in benzenoid systems, J. Chem. Inference Comput. Sci. 36 (1996) 1169-1172.
5. V.D. Chepoi, On distance-preserving and domination elimination orderings, SIAM J. Discrete Math. 11 (1998) 414-436.
6. V.D. Chepoi, F.F. Dragan, Linear-time algorithm for finding a central vertex of a chordal graph, in: Jan van Leeuwen (Ed.), "Algorithms - ESA'94" Second Annual European Symposium, Utrecht, The Netherlands, Lecture Notes in Computer Science, vol. 855, Springer, Berlin, 1994, pp. 159-170.
7. D.G. Corneil, F.F. Dragan, M. Habib, C. Paul, Diameters determination on restricted graph families, in: J. Hromkovic, O. Sykora (Eds.), 24th International Workshop "Graph-Theoretic Concepts in Computer Science" (WG'98), Smolenice Castle, Slovak Republic, Lecture Notes in Computer Science, vol. 1517, Springer, Berlin, 1998, pp. 192-202.
8. D.G. Corneil, S. Olariu, L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput., to appear.
9. D.G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? (Extended Abstract), Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January, 1998, pp. 175-180.
10. E. Dahlhaus, P.L. Hammer, F. Maffray, S. Olariu, On domination elimination orderings and domination graphs, in: E.W. Mayr, G. Schmidt, G. Tinhofer (Eds.), Proceedings of WG'94 "Graph-Theoretic Concepts in Computer Science", Lecture Notes in Computer Science, vol. 903, 1995, pp. 81-92.
11. F.F. Dragan, Dominating cliques in distance-hereditary graphs, in: E.M. Schmidt, S. Skyum (Eds.), "Algorithm Theory - SWAT'94" 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, Springer Lecture Notes in Computer Science, vol. 824, 1994, pp. 370-381.
12. F.F. Dragan, F. Nicolai, LexBFS-orderings and distance-hereditary graphs, Technical Report Gerhard-Mercator-Universität - Gesamthochschule Duisburg SM-DU-303, 1995.
13. F.F. Dragan, F. Nicolai, A. Brandstädt, LexBFS-orderings and powers of graphs, Proceedings of the WG'96, Lecture Notes in Computer Science, vol. 1197, 1997, pp. 166-180.
14. A.M. Farley, A. Proskurowski, Computation of the center and diameter of outerplanar graphs, Discrete Appl. Math. 2 (1980) 85-191.
15. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
16. M. Habib, R. McConnell, C. Paul, L. Viennot, Lex-BFS and partition refinement with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoret. Comput. Sci., to appear.
17. G. Handler, Minimax location of a facility in an undirected tree graph, Transportation Sci. 7 (1973) 287-293.
18. E. Howorka, A characterization of distance-hereditary graphs, Quart. J. Math. Oxford Ser. 2. 28 (1977) 417-420.
19. B. Jamison, S. Olariu, On the semi-perfect elimination, Adv. Appl. Math. 9 (1988) 364-376.
20. C.G. Lekkerkerker, J.C. Boland, Representation of a finite graph by a set of intervals on the real line, Fundam. Math. 51 (1962) 45-64.
21. S. Olariu, Weak bipolarizable graphs, Discrete Math. 74 (1989) 159-171.
22. S. Olariu, A simple linear-time algorithm for computing the center of an interval graph, Int. J. Comput. Math. 34 (1990) 121-128.
23. D. Rose, R.E. Tarjan, G. Lueker, Algorithmic aspects on vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.