NETWORK MODELS
Edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser
CHAPTER 8
Algorithmic Implications of the Graph Minor Theorem
D. Bienstock and M.A. Langston
1. Introduction*
2. A brief outline of the graph minors project
3. Treewidth
4. Pathwidth and cutwidth
5. Disjoint paths
6. Challenges to practicality
References
* The first two pages of the chapters are available as PDF file.
Complete chapters on ScienceDirect
[Description and order information]