Pages that link to "Item:Q967316"
From MaRDI portal
The following pages link to Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316):
Displaying 4 items.
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
- The graphs of stably matchable pairs (Q2672447) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)