Comparing linear width parameters for directed graphs (Q2322714): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963793539
@@ Property / OpenAlex ID: W2963793539 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06653
@@ Property / arXiv ID: 1812.06653 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Linear Ordering
@@ Property / cites work: Optimal Linear Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Directed Graphs
@@ Property / cites work: Classes of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Directed path-width and monotonicity in digraph searching
+Normal rank
@@ Property / cites work @@
+A complete axiomatisation for the inclusion of series-parallel partial orders
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Oriented Threshold Graphs
@@ Property / cites work: Oriented Threshold Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New graph classes of bounded clique-width
@@ Property / cites work: New graph classes of bounded clique-width / rank @@
+Normal rank
@@ Property / cites work @@
+Tournament immersion and cutwidth
@@ Property / cites work: Tournament immersion and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4165164
@@ Property / cites work: Q4165164 / rank @@
+Normal rank
@@ Property / cites work @@
+From tree-decompositions to clique-width terms
@@ Property / cites work: From tree-decompositions to clique-width terms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+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 @@
+Fully dynamic recognition algorithm and certificate for directed cographs
+Normal rank
@@ Property / cites work @@
+Quantitative Graph Theory
@@ Property / cites work: Quantitative Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607896
@@ Property / cites work: Q4607896 / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width and tree-width of \(H\)-minor-free graphs
+Normal rank
@@ Property / cites work @@
+Jungles, bundles, and fixed-parameter tractability
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
+Normal rank
@@ Property / cites work @@
+Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
+Normal rank
@@ Property / cites work @@
+Digraph width measures in parameterized algorithmics
+Normal rank
@@ Property / cites work @@
+Are there any good digraph width measures?
@@ Property / cites work: Are there any good digraph width measures? / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
+Normal rank
@@ Property / cites work @@
+Linear layouts measuring neighbourhoods in graphs
@@ Property / cites work: Linear layouts measuring neighbourhoods in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph parameters measuring neighbourhoods in graphs-bounds and applications
+Normal rank
@@ Property / cites work @@
+Directed path-width and directed tree-width of directed co-graphs
+Normal rank
@@ Property / cites work @@
+Knapsack problems: a parameterized point of view
@@ Property / cites work: Knapsack problems: a parameterized point of view / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationship between NLC-width and linear NLC-width
+Normal rank
@@ Property / cites work @@
+Vertex disjoint paths on clique-width bounded graphs
+Normal rank
@@ Property / cites work @@
+Directed NLC-width
@@ Property / cites work: Directed NLC-width / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic algorithms for graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+A Complete Characterisation of the Linear Clique-Width of Path Powers
+Normal rank
@@ Property / cites work @@
+Graphs of linear clique-width at most 3
@@ Property / cites work: Graphs of linear clique-width at most 3 / rank @@
+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 @@
+Algorithms for generalized vertex-rankings of partial k-trees
+Normal rank
@@ Property / cites work @@
+Matroid Pathwidth and Code Trellis Complexity
@@ Property / cites work: Matroid Pathwidth and Code Trellis Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Obstruction set isolation for the gate matrix layout problem
+Normal rank
@@ Property / cites work @@
+Computing directed pathwidth in \(O(1.89^n)\) time
+Normal rank
@@ Property / cites work @@
+On the Pathwidth of Almost Semicomplete Digraphs
@@ Property / cites work: On the Pathwidth of Almost Semicomplete Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the pathwidth of directed graphs with small vertex cover
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Layouts in Submodular Systems
@@ Property / cites work: Linear Layouts in Submodular Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width and vertex-minors
@@ Property / cites work: Rank-width and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width: algorithmic and structural results
@@ Property / cites work: Rank-width: algorithmic and structural results / 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. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Bounded Directed Pathwidth
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Digraph searching, directed vertex separation and directed pathwidth
+Normal rank
@@ Property / Wikidata QID @@
+Q128007649
@@ Property / Wikidata QID: Q128007649 / rank @@
+Normal rank