Recognizing Graph Search Trees

Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a graph is a search tree of a particular search on this graph was introduced by Hagerup and Nowak in 1985, and independently by Korach and Ostfeld in 1989 where the authors showed that this problem is efficiently solvable for DFS trees. A linear time algorithm for BFS trees was obtained by Manber in 1990. In this paper we prove that the search tree problem is also in P for LDFS, in contrast to LBFS, MCS, and MNS, where we show NP-completeness. We complement our results by providing linear time algorithms for these searches on split graphs.

[1]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[2]  Shimon Even,et al.  Graph Algorithms , 1979 .

[3]  U. Manbar.  Recognizing breadth-first search trees in linear time , 1990 .

[4]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[5]  Jesse Beisegel,et al.  Characterising AT-free Graphs with BFS , 2018, WG.

[6]  Michel Habib,et al.  Influence of the tie-break rule on the end-vertex problem , 2014, Discret. Math. Theor. Comput. Sci..

[7]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8]  Michel Habib,et al.  A new LBFS-based algorithm for cocomparability graph recognition , 2017, Discret. Appl. Math..

[9]  Zvi Ostfeld,et al.  DFS Tree Construction: Algorithms and Characterizations , 1988, WG.

[10]  Roberto Grossi,et al.  On computing the diameter of real-world undirected graphs , 2013, Theor. Comput. Sci..

[11]  Derek G. Corneil,et al.  A Unified View of Graph Searching , 2008, SIAM J. Discret. Math..

[12]  Jeremy P. Spinrad,et al.  Algorithms for Weakly Triangulated Graphs , 1995, Discret. Appl. Math..

[13]  Anne Berry,et al.  Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings , 2008, SIAM J. Discret. Math..

[14]  Robert E. Tarjan,et al.  Edge-disjoint spanning trees and depth-first search , 1976, Acta Informatica.

[15]  Ekkehard Köhler,et al.  On the End-Vertex Problem of Graph Searches , 2018, Discret. Math. Theor. Comput. Sci..

[16]  Michel Habib,et al.  LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs , 2013, SIAM J. Comput..

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Ekkehard Köhler,et al.  On end-vertices of Lexicographic Breadth First Searches , 2010, Discret. Appl. Math..

[19]  Stephan Olariu,et al.  Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs , 1995, SIAM J. Comput..

[20]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[21]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[22]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[23]  Erich Prisner.  Distance Approximating Spanning Trees , 1997, STACS.

[24]  Udi Manber,et al.  Recognizing Breadth-First Search Trees in Linear Time , 1990, Information Processing Letters.

[25]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[26]  Stephan Olariu,et al.  The LBFS Structure and Recognition of Interval Graphs , 2009, SIAM J. Discret. Math..

[27]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .