Parameterized complexity of even/odd subgraph problems (Q635735)

From MaRDI portal
Revision as of 17:23, 19 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q114162510, #quickstatements; #temporary_batch_1710865376617)
scientific article
Language Label Description Also known as
English
Parameterized complexity of even/odd subgraph problems
scientific article

    Statements

    title
    Parameterized complexity of even/odd subgraph problems (English)
    0 references
    author
    Leizhen Cai
    0 references
    Boting Yang
    0 references
    publication date
    23 August 2011
    0 references
    zbMATH Keywords
    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

    Identifiers

    zbMATH DE Number
    5941896
    0 references
    Wikidata QID
    Q114162510
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q635735&oldid=31223540"
    Powered by MediaWiki