1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
Frank Gurski, Robin Weishaupt
Tree-width and path-width are well-known graph parameters. Many NP-hard graph problems allow polynomial-time solutions, when restricted to graphs of bounded tree-width or bounded p…