|
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. |