Complexity Framework For Forbidden Subgraphs
share
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is ℋ-subgraph-free if it does not contain any of H_1,…,H_p as a subgraph. We give a meta-classification for ℋ-subgraph-free graphs: assuming a problem meets some three conditions, then it is “efficiently solvable” if ℋ contains a disjoint union of one or more paths and subdivided claws, and is “computationally hard” otherwise. The conditions are that the problem should be efficiently solvable on graphs of bounded treewidth, computationally hard on subcubic graphs, and computational hardness is preserved under edge subdivision. We illustrate the broad applicability of our meta-classification by obtaining a dichotomy between polynomial-time solvability and NP-completeness for many well-known partitioning, covering and packing problems, network design problems and width parameter problems. For other problems, we obtain a dichotomy between almost-linear-time solvability and having no subquadratic-time algorithm (conditioned on some hardness hypotheses). Along the way, we uncover and resolve several open questions from the literature, while adding many new ones.
READ FULL TEXT
