The following pages link to The dag-width of directed graphs (Q444380):
Displaying 38 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On the monotonicity of process number (Q299059) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs (Q477199) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Directed width parameters and circumference of digraphs (Q730003) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Directed elimination games (Q896668) (← links)
- Directed NLC-width (Q906393) (← links)
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes (Q1603521) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Entanglement and the complexity of directed graphs (Q1929212) (← links)
- On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- DAG-width and circumference of digraphs (Q2811203) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- (Q5005146) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
- The localization game on oriented graphs (Q6110602) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
- On the structure of solution-sets to regular word equations (Q6614609) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)
