Pages that link to "Item:Q494076"
From MaRDI portal
The following pages link to The complexity of minimum-length path decompositions (Q494076):
Displaying 8 items.
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- (Q2978407) (← links)
- (Q3341926) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)