The following pages link to Directed tree-width examples (Q2642009):
Displaying 18 items.
- On the monotonicity of process number (Q299059) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth (Q713301) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Directed NLC-width (Q906393) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Directed tree-width (Q1850539) (← links)
- Digraphs of directed treewidth one (Q2005715) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Introducing directed tree width (Q2741376) (← links)
- Graph searching games and width measures for directed graphs (Q2954982) (← links)
- LIFO-Search on Digraphs: A Searching Game for Cycle-Rank (Q3088285) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
