Pages that link to "Item:Q3452781"
From MaRDI portal
The following pages link to Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781):
Displaying 5 items.
- Complexity of token swapping and its variants (Q722547) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)
