Are there any good digraph width measures?
From MaRDI portal
Publication:896003
Recommendations
Cites work
- scientific article; zbMATH DE number 612169 (Why is no real title available?)
- scientific article; zbMATH DE number 1007358 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- A Min-Max Theorem on Tournaments
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
- Approximating clique-width and branch-width
- Clique-width: when hard does not mean impossible
- Complexity of the network median problem on planar grids
- DAG-Width and Parity Games
- DAG-width
- Digraph measures: Kelly decompositions, games, and orderings
- Digraph width measures in parameterized algorithmics
- Directed nowhere dense classes of graphs
- Directed path-width and monotonicity in digraph searching
- Directed tree-width
- Easy problems for tree-decomposable graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- How to draw a planar graph on a grid
- Linear time solvable optimization problems on graphs of bounded clique-width
- List-Coloring Squares of Sparse Subcubic Graphs
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Mathematical Foundations of Computer Science 2005
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
- On topological tournaments of order 4 in digraphs of outdegree 3
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Quickly excluding a planar graph
- Some simplified NP-complete graph problems
- The dag-width of directed graphs
- The directed subgraph homeomorphism problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The rank-width of edge-coloured graphs
- Tournament minors
- Tree-width and the monadic quantifier hierarchy.
- Treewidth: Characterizations, Applications, and Computations
- Upper bounds to the clique width of graphs
Cited in
(26)- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Directed width parameters on semicomplete digraphs
- Acyclic coloring parameterized by directed clique-width
- Computing the zig-zag number of directed graphs
- Digraphs of bounded width
- Subgraphs satisfying MSO properties on \(z\)-topologically orderable digraphs
- The dag-width of directed graphs
- Are there any good digraph width measures?
- Directed ear anonymity
- Classes of intersection digraphs with good algorithmic properties
- Digraph width measures in parameterized algorithmics
- Directed tree-width
- Digraph coloring and distance to acyclicity
- On the algorithmic effectiveness of digraph decompositions and complexity measures
- Faster algorithms for counting subgraphs in sparse graphs
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- On digraph width measures in parameterized algorithmics
- How to compute digraph width measures on directed co-graphs
- Graph searching games and width measures for directed graphs
- Mathematical Foundations of Computer Science 2005
- On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
- Embedding phylogenetic trees in networks of low treewidth
- Comparing linear width parameters for directed graphs
- Synchronizing series-parallel deterministic finite automata with loops and related problems
- Dualities in graphs and digraphs
- Algorithmic properties of sparse digraphs
This page was built for publication: Are there any good digraph width measures?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896003)
