Lexicographic breadth first search - A survey

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

Volumn 3353, Issue , 2004, Pages 1-19

  Corneil, Derek G ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; CHORDAL GRAPHS; FREE GRAPHS; GRAPH SEARCHING; LEXICOGRAPHIC BREADTH FIRST SEARCH; PAPER SURVEYS; AT-FREE;

GRAPH THEORY;

SURVEYS;

EID: 33744955846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30559-0_1     Document Type: Article

References (45)

1. H-K. Bandelt and H.M. Mulder: Distance-hereditary graphs, J. Combin. Theory B 41 (1986) 182-208.
2. A. Berry and J-P. Bordat: Separability generalizes Dirac's theorem, Disc. Appl. Math. 84 (1998) 43-53.
3. K.S. Booth and G.S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976) 335-379.
4. A. Brandstädt and F.F. Dragan: On linear and circular structure of a (claw,net)-free graph, Disc. Appl. Math. 129 (2003) 285-303.
5. A. Brandstädt, F.F. Dragan and F. Nicolai: LexBFS-orderings and powers of chordal graphs, Disc. Math. 171 (1997) 27-42.
6. A. Brandstädt, V.B. Le and J.P. Spinrad: Graph Classes: A Survey, SIAM Monographs on Disc. Math, and Applic., SIAM 1999.
7. A. Bretscher: LexBFS based recognition algorithms for cographs and related families, Ph.D. thesis in preparation, Dept. of Computer Science, University of Toronto, Toronto, Canada.
8. A. Bretscher, D.G. Corneil, M. Habib and C. Paul: A simple linear time LexBFS cograph recognition algorithm (extended abstract), LNCS 2880 (2003) 119-130.
9. J-M. Chang, C-W. Ho and M-T. Ko: LexBFS-ordering in Asteroidal Triple-free graphs, LNCS 1741 (1999) 163-172.
10. V. Choi and M. Farach-Colton: Barnacle: an assembly algorithm for clone-based sequences of whole genomes, Gene 320 (2003) 165-176.
11. D.G. Corneil, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs: Disc. Appl. Math. 138 (2004) 371-379.
12. D.G. Corneil, F.F. Dragan, M. Habib and C. Paul: Diameter determination on restricted graph families, Disc. Appl. Math. 113 (2001) 143-166.
13. D.G. Corneil, F.F. Dragan and E. Koehler: On the power of BFS to determine a graph's diameter, Networks 42 (2003) 209-222.
14. D.G. Corneil and E. Koehler: unpublished manuscript.
15. D.G. Corneil, E. Koehler and J-M. Lanlignel: On LBFS end-vertices, in preparation.
16. D.G. Cornell and R. Krueger: A unified view of graph searching, in preparation.
17. D.G. Cornell, S. Olariu, and L. Stewart: The LBFS structure and recognition of interval graphs, under revision; extended abstract appeared as The ultimate interval graph recognition algorithm? (extended abstract) in Proc. SODA 98, Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (1998) 175-180.
18. D.G. Corneil, S. Olariu, and L. Stewart: Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput. 28 (1999) 1284-1297.
19. F.F. Dragan: Almost diameter of a house-hole-free graph in linear time via LexBFS, Disc. Appl. Math. 95 (1999) 223-239.
20. F.F. Dragan: Estimating all pairs shortest paths in restricted graph families: a unified approach (extended abstract), LNCS 2204 (2001) 103-116.
21. F.F. Dragan and F. Nicolai: Lex-BFS-orderings of distance-hereditary graphs, Schriftenreihe des Fachbereichs Mathematik der Universität Duisburg, Duisburg, Germany, SM-DU-303 (1995).
22. F.F. Dragan, F. Nicolai, and A. Brandstädt: LexBFS-orderings and powers of graphs, LNCS 1197 (1997) 166-180.
23. D.R. Fulkerson and O.A. Gross: Incidence matrices and interval graphs, Pacific J. Math. 15 (1965) 835-855.
24. M. Habib, R. McConnell, C. Paul and L. Viennot: Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoret. Comput. Sci. 234 (2000) 59-84.
25. P. Hell and J. Huang: Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs, to appear SIAM J. Disc. Math. (2004).
26. M.S. Jacobson, F.R. McMorris, and H.M. Mulder: Tolerance intersection graphs, in 1988 International Kalamazoo Graph Theory Conference, Y. Alavi et al, eds., Wiley 1991 705-724.
27. B. Jamison, S. Olariu: On the semi-perfect elimination, Advances in Appl. Math. 9 (1988) 364-376.
28. D. Kratsch and L. Stewart: Domination on cocomparability graphs, SIAM J. Disc. Math. 6 (1993) 400-417.
29. N. Korte and R.H. Möhring: An incremental linear-time algorithm for recognizing interval graphs, SIAM J. Comput. 18 (1989) 68-81.
30. J-M. Lanlignel: Private communications, 1999.
31. P.J. Looges and S. Olariu: Optimal greedy algorithms for indifference graphs, Computers Math. Applic. 25 (1993) 15-25.
32. T. Ma: unpublished manuscript.
33. R.M. McConnell and J. Spinrad: Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proc. SODA 94, Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (1994) 536-545.
34. D. Meister: Recognizing and computing minimal triangulations efficiently, Technical Report 302, Fakultät für Mathematik und Informatik, Universität Würzburg, 2002.
35. F. Nicolai: A hypertree characterization of distance-hereditary graphs, manuscript, Gerhard-Mercator-Universität Duisburg (1996).
36. S. Olariu: An optimal greedy heuristic to color interval graphs, Inform. Process. Lett. 37 (1991) 65-80.
37. G. Ramalingam and C. Pandu Rangan: A uniform approach to domination problems on interval graphs, Inform. Process. Lett., 27 (1988) 271-274.
38. A. Raychaudhuri: On powers of interval and unit interval graphs, Congr. Numer. 59 (1987) 235-242.
39. F.S. Roberts: Indifference graphs, in: F. Harary, ed., Proof Techniques in Graph Theory, Academic Press, New York, 1969 139-146.
40. F.S. Roberts: On the compatibility between a graph and a simple order, J. Combin. Theory Ser. B 11 (1971) 28-38.
41. R.E. Tarjan: Depth first search and linear graph algorithms, SIAM J. Comput. 1 (1972) 146-160.
42. D.J. Rose, R.E. Tarjan, and G.S. Lueker: Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976) 266-283.
43. R.E. Tarjan and M. Yannakakis: 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.
44. K. Simon: A new simple linear algorithm to recognize interval graphs, LNCS 553 (1992) 289-308.
45. n, Ph.D. thesis, Universität Göttigen, Germany, 1967.