The complexity of induced minors and related problems

The computational complexity of a number of problems concerning induced structures in graphs is studied, and compared with the complexity of corresponding problems concerning non-induced structures. The effect on these problems of restricting the input to planar graphs is also considered. The principal results include: (1) Induced Maximum Matching and Induced Directed Path are NP-complete for planar graphs, (2) for every fixed graphH, InducedH-Minor Testing can be accomplished for planar graphs in time0(n), and (3) there are graphsH for which InducedH-Minor Testing is NP-complete for unrestricted input. Some useful structural theorems concerning induced minors are presented, including a bound on the treewidth of planar graphs that exclude a planar induced minor.

[1]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

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

[3]  Paul D. Seymour.  Disjoint paths in graphs , 2006, Discret. Math..

[4]  Jan Kratochvíl,et al.  Noncrossing Subgraphs in Topological Layouts , 1991, SIAM J. Discret. Math..

[5]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[6]  Robin Thomas,et al.  Graphs without K4 and well-quasi-ordering , 1985, J. Comb. Theory, Ser. B.

[7]  J. Matousek,et al.  On polynomial time decidability of induced-minor-closed classes , 1988 .

[8]  Bruce A. Reed,et al.  Induced Circuits in Planar Graphs , 1994, J. Comb. Theory, Ser. B.

[9]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[10]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[11]  Alexander Schrijver,et al.  Disjoint homotopic paths and trees in a planar graph , 1991, Discret. Comput. Geom..

[12]  Anna Lubiw.  A note on odd/even cycles , 1988, Discret. Appl. Math..

[13]  Carsten Thomassen,et al.  2-Linked Graphs , 1980, Eur. J. Comb..

[14]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[15]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[16]  Yossi Shiloach,et al.  A Polynomial Solution to the Undirected Two Paths Problem , 1980, JACM.

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