Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650)

From MaRDI portal
Revision as of 23:30, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60488413, #quickstatements; #temporary_batch_1711574657256)
scientific article
Language Label Description Also known as
English
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
scientific article

    Statements

    Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized algorithms
    0 references
    subexponential running time
    0 references
    directed graph
    0 references
    graph algorithms
    0 references
    0 references
    0 references