Home | People | Seminar | Conferences | Resources


Title: Graph Minors and Branch Decompositions

Abstract: Branch decompositions were introduced by Robertson and Seymour during their proof of Wagner's conjecture. Recently, branch decompositions have been studied for their algorithmic capabilities to solve NP-hard problems. We offer a practical implementation of a branch decomposition based algorithm to test for minor containment.

Return to the seminar page.

Home | People | Seminar | Conferences | Resources

Please send comments about this page to Maurice Rojas at rojas@math.tamu.edu.
Last Modified on 24/Apr/01