Directed branch-width: a directed analogue of tree-width
From MaRDI portal
Cites work
- F-rank-width of (edge-colored) graphs
- Approximating clique-width and branch-width
- Are there any good digraph width measures?
- Call routing and the ratcatcher
- Constructive linear time algorithms for branchwidth
- Deleting edges to restrict the size of an epidemic in temporal networks
- Digraph measures: Kelly decompositions, games, and orderings
- Digraphs of bounded width
- Directed NLC-width
- Directed tree-width
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XX: Wagner's conjecture
- Graph theory
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 2044924 (Why is no real title available?)
- Intractability of clique-width parameterizations
- Line graphs of bounded clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- Mathematical Foundations of Computer Science 2005
- Nonserial dynamic programming
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Parameterized algorithms
- Parametrized complexity theory.
- Rank-width: algorithmic and structural results
- Rank‐width is less than or equal to branch‐width
- S-functions for graphs
- Some properties of line digraphs
- Submodular partition functions
- Tangle-tree duality in abstract separation systems
- The dag-width of directed graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The rank-width of the square grid
- Unifying duality theorems for width parameters in graphs and matroids (extended abstract)
This page was built for publication: Directed branch-width: a directed analogue of tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409409)
