Are there any good digraph width measures? (Q896003): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2015.09.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1900846841
@@ Property / OpenAlex ID: W1900846841 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the network median problem on planar grids
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ Property / cites work @@
+The dag-width of directed graphs
@@ Property / cites work: The dag-width of directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+A Min-Max Theorem on Tournaments
@@ Property / cites work: A Min-Max Theorem on Tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+List-Coloring Squares of Sparse Subcubic Graphs
@@ Property / cites work: List-Coloring Squares of Sparse Subcubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298571
@@ Property / cites work: Q4298571 / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+Q3113705
@@ Property / cites work: Q3113705 / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
+Normal rank
@@ Property / cites work @@
+Digraph width measures in parameterized algorithmics
+Normal rank
@@ Property / cites work @@
+Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4336034
@@ Property / cites work: Q4336034 / rank @@
+Normal rank
@@ Property / cites work @@
+Digraph measures: Kelly decompositions, games, and orderings
+Normal rank
@@ Property / cites work @@
+Directed tree-width
@@ Property / cites work: Directed tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+The rank-width of edge-coloured graphs
@@ Property / cites work: The rank-width of edge-coloured graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tournament minors
@@ Property / cites work: Tournament minors / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743498
@@ Property / cites work: Q5743498 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
+Normal rank
@@ Property / cites work @@
+On topological tournaments of order 4 in digraphs of outdegree 3
+Normal rank
@@ Property / cites work @@
+Tree-width and the monadic quantifier hierarchy.
@@ Property / cites work: Tree-width and the monadic quantifier hierarchy. / rank @@
+Normal rank
@@ Property / cites work @@
+DAG-width
@@ Property / cites work: DAG-width / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank