Diameter determination on restricted graph families

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

Volumn 1517, Issue , 1998, Pages 192-202

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

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF ROSTOCK   (Germany)

^c LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; GRAPHIC METHODS;

CHORDAL GRAPHS; DIAMETER PROBLEM; DIRECTED PATHS; GRAPH OPERATIONS; INDUCED SUBGRAPHS; INTERVAL GRAPH; LINEAR TIME; QUADRATIC TIME;

GRAPH ALGORITHMS;

EID: 84947943001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692760_16     Document Type: Conference Paper

References (14)

1. P. Buneman. A characterization of rigid circuit graphs. Discr. Math., 9:205-212, 1974.
2. V.D. Chepoi and F.F. Dragan. Disjoint set problem. unpublished, 1992.
3. D.G. Corneil, S. Olariu, and L. Stewart. Linear time algorithms for dominating pairs in asteroidal triple-free graphs. Technical Report 294-95, University of Toronto, January 1995. To appear in SIAM Journal of Computing.
4. D.G. Corneil, S. Olariu, and L. Stewart. Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics, 10(3):399-431, 1997.
5. F. Dragan, F. Nicolai, and A. Brandstadt. Lex-BFS orderings and powers of graphs. In Graph-Theoretic Concepts in Computer Science, WG'96, volume 1197 of Lecture Notes in Computer Science, pages 166-180. WG'96, 1997.
6. Feodor Dragan. Almost diameter in hhd-free graphs in linear time via lex-bfs. In Optimal Discrete Structures and Algorithms. University of Rostock, Germany, 1997.
7. F. Gavril. The intersection graphs of a path in a tree are exactly the chordal graphs. Journ. Comb. Theory, 16:47-56, 1974.
8. F. Gavril. A recognition algorithm for the intersection graph of directed paths in directed trees. Discr. Math., 13:337-349, 1975.
9. M.C. Golumbic. Algorithms Graph Theory and Perfect Graphs. Academic Press, New York University, 1980.
10. B. Jamison and S. Olariu. On the semi-perfect elimination. Advances in Applied Mathematics, 9:364-376, 1988.
11. C.G. Lekkerkerker and J.C Boland. Representation of a finite graph by a set of intervals on the real line. Fund. Math., 51:45-64, 1962.
12. M. Lesk. Couplages maximaux et diametre de graphes. PhD thesis, Universite Pierre et Marie Curie, Paris 6, October 1984.
13. C. Paul. Parcours en largeur lexicographique: un algorithme de partitionnement, application aux graphes et generalisation. PhD thesis, LIRMM, Universite de Mont- pellier II, 1998.
14. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal of Computing, 5(2):266-283, June 1976.