Pages that link to "Item:Q2908539"
From MaRDI portal
The following pages link to Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539):
Displaying 6 items.
- The complexity of minimum-length path decompositions (Q494076) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- (Q5091271) (← links)
