Introducing directed tree width
From MaRDI portal
Recommendations
- Directed tree-width
- Directed tree-width examples
- Mathematical Foundations of Computer Science 2005
- SOFSEM 2005: Theory and Practice of Computer Science
- Computing tree width: from theory to practice and back
- Treewidth: Structure and Algorithms
- scientific article; zbMATH DE number 1944139
- Directed tree decompositions
- Connected tree-width
Cited in
(27)- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- How to compute digraph width measures on directed co-graphs
- An algorithmic metatheorem for directed treewidth
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Digraphs of bounded width
- Jumping robbers in digraphs
- DAG-width is PSPACE-complete
- Towards the graph minor theorems for directed graphs
- Domino Treewidth
- The dag-width of directed graphs
- Constant congestion routing of symmetric demands in planar directed graphs
- Approximation algorithms for digraph width parameters
- Packing directed circuits quarter-integrally
- Directed path-decompositions
- Directed nowhere dense classes of graphs
- Digraph decompositions and monotonicity in digraph searching
- Redicolouring digraphs: directed treewidth and cycle-degeneracy
- Packing directed cycles quarter- and half-integrally
- Untangling Gaussian mixtures
- A half-integral Erdős-Pósa theorem for directed odd cycles
- Computing the zig-zag number of directed graphs
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- Directed elimination games
- Digraph measures: Kelly decompositions, games, and orderings
- Digraph searching, directed vertex separation and directed pathwidth
- Monotonicity in digraph search problems
This page was built for publication: Introducing directed tree width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741376)
