Directed tree-width examples
From MaRDI portal
Publication:2642009
Recommendations
Cited in
(20)- Digraphs of directed treewidth one
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Digraphs of bounded width
- The dag-width of directed graphs
- Digraph Decompositions and Monotonicity in Digraph Searching
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Digraph width measures in parameterized algorithmics
- Directed tree-width
- Introducing directed tree width
- Directed NLC-width
- Cut-sufficient directed 2-commodity multiflow topologies
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- Digraph searching, directed vertex separation and directed pathwidth
- Tree-Width for First Order Formulae
- LIFO-search on digraphs: a searching game for cycle-rank
- Graph searching games and width measures for directed graphs
- Mathematical Foundations of Computer Science 2005
- Monotonicity of strong searching on digraphs
- Digraph measures: Kelly decompositions, games, and orderings
- On the monotonicity of process number
This page was built for publication: Directed tree-width examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642009)