Pages that link to "Item:Q476883"
From MaRDI portal
The following pages link to Approximation algorithms for digraph width parameters (Q476883):
Displaying 8 items.
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes (Q1603521) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Directed Pathwidth and Palletizers (Q3467832) (← links)
- Parameterized Approximation Schemes Using Graph Widths (Q5167791) (← links)
- (Q5874334) (← links)