Koster, Arie M.C.A.; Bodlaender, Hans L.; Hoesel, Stan … - Maastricht : METEOR, Maastricht Research School of … - 2002
Many NP-complete graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find...
