The following pages link to Introducing directed tree width (Q2741376):
Displaying 24 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Jumping robbers in digraphs (Q343927) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Directed elimination games (Q896668) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Domino Treewidth (Q4349700) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- (Q5075819) (← links)
- Directed Path-Decompositions (Q5215903) (← links)
- (Q5743498) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
