Diameter determination on restricted graph families

Discrete Applied Mathematics

Volumn 113, Issue 2-3, 2001, Pages 143-166

  Corneil, Derek G ^a   Dragan, Feodor F ^b   Habib, Michel ^c   Paul, Christophe ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035887617     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00281-X     Document Type: Article

References (30)

1. Aingworth D., Chekuri C., Indyk P., Motwani R. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28:1999;1167-1181.
2. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hyper-tree structure and maximum neighborhood 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, Springer, Berlin, 1995, pp. 65-80; Discrete Appl. Math. 82 (1998) 43-77.
3. A. Brandstädt, V.D. Chepoi, F.F. Dragan, The algorithmic use of hyper-tree structure and maximum neighborhood 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, Springer, Berlin, 1995, pp. 65-80; Discrete Appl. Math. 82 (1998) 43-77.
4. Buneman P. A characterization of rigid circuit graphs. Discrete Math. 9:1974;205-212.
5. Chepoi V.D. On distances in benzenoid systems. J. Chem. Inference Comput. Sci. 36:1996;1169-1172.
6. V.D. Chepoi, F.F. Dragan, Disjoint sets problem, unpublished, 1992.
7. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progression, Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, pp. 1-6.
8. Corneil D.G., Dragan F.F., Habib M., Paul C. Diameter determination on restricted graph families. Hromkovic J., Sykora O. Proceedings of WG'98 Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science. Vol. 1517:1988;192-202 Springer, Berlin.
9. Corneil D.G., Olariu S., Stewart L. Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 28:1999;1284-1297.
10. Corneil D.G., Olariu S., Stewart L. Asteroidal triple-free graphs. SIAM J. Discrete Math. 10:1997;399-431.
11. E. Dahlhaus, Optimal (parallel) algorithms for the all-to-all vertex distances problem for certain graph classes, in: Proceedings of WG'92, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 657, Springer, Berlin, 1993, pp. 60-69.
12. Dragan F.F. Dominating cliques in distance-hereditary graphs. Schmidt E.M., Skyum S. Proceedings of SWAT'94 Fourth Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science. Vol. 824:1994;370-381 Springer, Berlin.
13. Dragan F.F. Almost diameter of a house-hole-free graph in linear time via LexBFS. Discrete Appl. Math. 95:1999;223-239.
14. Dragan F.F., Nicolai F. LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. Discrete Appl. Math. 98:2000;191-207.
15. 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, Springer, Berlin, 1997, pp. 166-180.
16. Farber M. Characterizations of strongly chordal graphs. Discrete Math. 43:1983;173-189.
17. Farley A.M., Proskurowski A. Computation of the center and diameter of outerplanar graphs. Discrete Appl. Math. 2:1980;185-191.
18. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory (B). 16:1974;47-56.
19. Gavril F. A recognition algorithm for the intersection graph of directed paths in directed trees. Discrete Math. 13:1975;237-249.
20. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
21. Han K., Sekharan C.N., Sridhar R. Unified all-pairs shortest path algorithms in the chordal hierarchy. Discrete Appl. Math. 77:1997;59-71.
22. Handler G. Minimax location of a facility in an undirected tree graph. Transp. Sci. 7:1973;287-293.
23. Jamison B., Olariu S. On the semi-perfect elimination. Adv. Appl. Math. 9:1988;364-376.
24. Lekkerkerker C.G., Boland J.C. Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51:1962;45-64.
25. M. Lesk, Couplages maximaux et diamètre de graphes, Ph.D. Thesis, Université Pierre et Marie Curie, Paris 6, October 1984.
26. Olariu S. A simple linear-time algorithm for computing the center of an interval graph. Int. J. Comput. Math. 34:1990;121-128.
27. C. Paul, Parcours en largeur lexicographique: un algorithme de partitionnement, application aux graphes et généralisation, Ph.D. Thesis, University of Montpellier II, France, 1998.
28. Rose D., Tarjan R.E., Lueker G. Algorithmic aspects on vertex elimination on graphs. SIAM J. Comput. 5:1976;266-283.
29. R. Seidel, On the all-pair-shortest-path problem, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 745-749.
30. Tarjan R.E., Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13:1984;566-579.