A simpler algorithm and shorter proof for the graph minor decomposition

@inproceedings{Kawarabayashi2011ASA,
  title={A simpler algorithm and shorter proof for the graph minor decomposition},
  author={Ken-ichi Kawarabayashi and Paul Wollan},
  booktitle={STOC},
  year={2011}
}
At the core of the Robertson-Seymour theory of graph minors lies a powerful decomposition theorem which captures, for any fixed graph H, the common structural features of all the graphs which do not contain H as a minor. Robertson and Seymour used this result to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation, as well as give a polynomial time algorithm for the disjoint paths problem when the number of the terminals is fixed. The theorem has… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

Approximation algorithms for NP-complete problems on planar graphs

  • B. S. Baker
  • J. Assoc. Comput. Mach., 41
  • 1994
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…