Pages that link to "Item:Q2819486"
From MaRDI portal
The following pages link to On the Complexity of Computing Treebreadth (Q2819486):
Displaying 13 items.
- On the complexity of computing treelength (Q972342) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- Equivalence between pathbreadth and strong pathbreadth (Q2416435) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- Computing Tree-Depth Faster Than 2 n (Q2867079) (← links)
- Treewidth and the Computational Complexity of MAP Approximations (Q2938412) (← links)
- On Strong Tree-Breadth (Q2958304) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- Estimating the Size of Branch-and-Bound Trees (Q5085999) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)