DAG-width is PSPACE-complete (Q343929): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Directed path-width and monotonicity in digraph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dag-width of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Domination Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination search number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Distance d-Domination Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank

Latest revision as of 23:57, 12 July 2024

scientific article
Language Label Description Also known as
English
DAG-width is PSPACE-complete
scientific article

    Statements

    DAG-width is PSPACE-complete (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    graph searching games
    0 references
    DAG-width
    0 references
    PSPACE-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references