How to compute digraph width measures on directed co-graphs (Q2220888): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3110485412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-Disjoint Paths in Decomposable Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width and monotonicity in digraph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete axiomatisation for the inclusion of series-parallel partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dag-width of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From tree-decompositions to clique-width terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic recognition algorithm and certificate for directed cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Digraph Width Measures in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph width measures in parameterized algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are there any good digraph width measures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations for special directed co-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing digraph width measures on directed co-graphs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented coloring on recursively defined digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset sum problems with special digraph constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width and directed tree-width of directed co-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width of sequence digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pathwidth of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph measures: Kelly decompositions, games, and orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for generalized vertex-rankings of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing directed pathwidth in \(O(1.89^n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Pathwidth of Almost Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the pathwidth of directed graphs with small vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Layouts in Submodular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial homology relations -- satisfiability in terms of di-cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for directed modular width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dacey Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Bounded Directed Pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs of directed treewidth one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph searching, directed vertex separation and directed pathwidth / rank
 
Normal rank

Latest revision as of 09:33, 24 July 2024

scientific article
Language Label Description Also known as
English
How to compute digraph width measures on directed co-graphs
scientific article

    Statements

    How to compute digraph width measures on directed co-graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 January 2021
    0 references
    directed path-width
    0 references
    directed tree-width
    0 references
    directed feedback vertex set number
    0 references
    directed feedback arc set number
    0 references
    cycle rank
    0 references
    DAG-depth
    0 references
    DAG-width
    0 references
    Kelly-width
    0 references
    directed co-graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers