A unified view of graph searching

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 4, 2008, Pages 1259-1276

  Corneil, Derek G ^a   Krueger, Richard M ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Breadth first search; Depth first search; Graph searching; Graph traversal; LexBFS

Indexed keywords

BREADTH-FIRST SEARCH; DEPTH FIRST SEARCH; GRAPH ALGORITHMS; GRAPH SEARCH ALGORITHM; GRAPH SEARCHING; IMPOSSIBILITY RESULTS; NEIGHBORHOOD SEARCH; SEARCH ALGORITHMS; THEORETICAL RESULT; VERTEX ORDERING;

LEARNING ALGORITHMS;

EID: 70350128917     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050623498     Document Type: Article

References (15)

1. A. Brandstädt, F. F. Dragan, and F. Nicolai, LexBFS-orderings and powers of chordal graphs, Discrete Math., 171 (1997), pp. 27-42. (Pubitemid 127379673)
2. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2nd ed., McGraw-Hill, New York, 2001.
3. D. G. Corneil, Lexicographic breadth first search-a survey, in Graph-Theoretic Concepts in Computer Science, Proceedings of WG2004, Lecture Notes in Comput. Sci. 3353, Springer, Berlin, 2004, pp. 1-19.
4. D. G. Corneil, S. Olariu, and L. Stewart, LBFS orderings and cocomparability graphs, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1999, pp. S883-S884.
5. E. Dahlhaus, J. Gustedt, and R. M. McConnell, Partially complemented representations of digraphs, Discrete Math. Theor. Comput. Sci., 5 (2002), pp. 147-168.
6. D. R. Fulkerson and O. A. Gross, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), pp. 835-855.
7. H. Gabow, Searching, in Handbook of Graph Theory, J. Gross and J. Yellen, eds., CRC Press, Boca Raton, FL, 2004, pp. 953-984.
8. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980; second edition, Ann. Discrete Math. 57, Elsevier, Amsterdam, 2004.
9. 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), pp. 59-84.
10. R. Krueger, Graph Searching, Ph.D. thesis, University of Toronto, 2005.
11. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
12. D. R. Shier, Some aspects of perfect elimination orderings in chordal graphs, Discrete Appl. Math., 7 (1984), pp. 325-331.
13. J. Spinrad, Efficient implementation of lexicographic depth first search, in preparation.
14. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
15. 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), pp. 566-579 (Pubitemid 15514404)