On Linear Time Minor Tests and Depth First Search

Recent results on graph minors make it desirable to have efficient algorithms, that for a fixed set of graphs {H1, ..., H c }, test whether a given graph G contains at least one graph H i as a minor. In this paper we show the following result: if at least one graph H i is a minor of a 2 × k grid graph, and at least one graph H i is a minor of a circus graph, then one can test in \(\mathcal{O}\)(n) time whether a given graph G contains at least one graph H∈{H1, ..., H c } as a minor. This result generalizes a result of Fellows and Langston. The algorithm is based on depth first search and on dynamic programming on graphs with bounded treewidth. As a corollary, it follows that the MAXIMUM LEAF SPANNING TREE problem can be solved in linear time for fixed k. We also discuss that with small modifications, an algorithm of Fellows and Langston can be modified to an algorithm that finds in \(\mathcal{O}\)(k!2 k n) time a cycle (or path) in a given graph with length≥k if it exists.

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

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

[3]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[4]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[5]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[6]  B. Monien.  How to Find Long Paths Efficiently , 1985 .

[7]  Paul D. Seymour,et al.  Graph minors. VI. Disjoint paths across a disc , 1986, J. Comb. Theory, Ser. B.

[8]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[9]  Stephen T. Hedetniemi,et al.  Linear algorithms on k-terminal graphs , 1987 .

[10]  Clemens Lautemann,et al.  Efficient Algorithms on Context-Free Graph Grammars , 1988, ICALP.

[11]  Hans L. Bodlaender,et al.  NC-Algorithms for Graphs with Small Treewidth , 1988, WG.

[12]  Detlef Seese,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

[13]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[14]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..