Remarks Most results for treewidth have faster algorithms for (NP-) hard problems This one: faster for polynomial time solvable problem Experiments by Plancken show results are practical Shortest paths and treewidth30
{}