On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704)

From MaRDI portal
Revision as of 19:14, 5 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
On the algorithmic effectiveness of digraph decompositions and complexity measures
scientific article

    Statements

    On the algorithmic effectiveness of digraph decompositions and complexity measures (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    0 references
    treewidth
    0 references
    digraph decompositions
    0 references
    parameterized complexity
    0 references
    0 references