Entanglement and the complexity of directed graphs (Q1929212)

From MaRDI portal
Revision as of 02:20, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Entanglement and the complexity of directed graphs
scientific article

    Statements

    Entanglement and the complexity of directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    structural graph theory
    0 references
    graph searching games
    0 references
    parity games
    0 references
    digraph algorithms
    0 references
    treewidth
    0 references
    DAG-width
    0 references
    Kelly-width
    0 references
    0 references