Directed tree-width examples
From MaRDI portal
Publication:2642009
DOI10.1016/J.JCTB.2006.12.006zbMATH Open1122.05039OpenAlexW2079873939MaRDI QIDQ2642009FDOQ2642009
Authors: Isolde Adler 
Publication date: 20 August 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.12.006
Recommendations
Cites Work
Cited In (20)
- Directed NLC-width
- The dag-width of directed graphs
- Mathematical Foundations of Computer Science 2005
- Tree-Width for First Order Formulae
- Digraphs of directed treewidth one
- LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
- Digraph measures: Kelly decompositions, games, and orderings
- On the monotonicity of process number
- Digraph Decompositions and Monotonicity in Digraph Searching
- Monotonicity of strong searching on digraphs
- Directed tree-width
- Graph searching games and width measures for directed graphs
- LIFO-search on digraphs: a searching game for cycle-rank
- Digraph searching, directed vertex separation and directed pathwidth
- Digraph width measures in parameterized algorithmics
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Introducing directed tree width
- Cut-sufficient directed 2-commodity multiflow topologies
- Digraphs of bounded width
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)
