Parameterized complexity of even/odd subgraph problems (Q635735)

From MaRDI portal
Revision as of 10:36, 4 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
Parameterized complexity of even/odd subgraph problems
scientific article

    Statements

    Parameterized complexity of even/odd subgraph problems (English)
    0 references
    0 references
    0 references
    23 August 2011
    0 references
    0 references
    parameterized complexity
    0 references
    FPT algorithms
    0 references
    Eulerian graphs
    0 references
    even graphs
    0 references
    odd graphs
    0 references
    color-coding
    0 references
    random separation
    0 references
    0 references
    0 references