On computing graph minor obstruction sets
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties are characterized by a finite set of forbidden substructures, the obstructions for the property. We prove several general theorems regarding the computation of obstruction sets from other information about a family of graphs. The methods can be adapted to other partial orders on graphs, such as the immersion and topological orders. The algorithms are in some cases practical and have been implemented. Two new technical ideas are introduced. The first is a method of computing a stopping signal for search spaces of increasing pathwidth. This allows obstruction sets to be computed without the necessity of a prior bound on maximum obstruction width. The second idea is that of a second or order congruence for a graph property. This is an equivalence relation defined on finite sets of graphs that generalizes the recognizability congruence that is defined on single graphs. It is shown that the obstructions for a graph ideal can be effectively computed from an oracle for the canonical second-order congruence for the ideal and a membership oracle for the ideal. It is shown that the obstruction set for a union F = F-1 boolean OR F-2 of minor ideals can be computed from the obstruction sets for F-1 and F-2 if there is at least one tree that does not belong to the intersection of F-1 and F-2. As a corollary, it is shown that the set of intertwines of an arbitrary graph and a tree are effectively computable. (C) 2000 Elsevier Science B.V. All rights reserved.
intertwines graph miners well-quasi-ordering obstruction set computation automatic theorem-proving finite automats