Pages that link to "Item:Q1987233"
From MaRDI portal
The following pages link to On the complexity of computing treebreadth (Q1987233):
Displaying 7 items.
- On the complexity of computing treelength (Q972342) (← links)
- On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
- Computing Tree-Depth Faster Than 2 n (Q2867079) (← links)
- Treewidth and the Computational Complexity of MAP Approximations (Q2938412) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- Treelength of series-parallel graphs (Q6069145) (← links)
