Parameterized complexity of connected even/odd subgraph problems (Q395000)

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

    Statements

    title
    Parameterized complexity of connected even/odd subgraph problems (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Petr A. Golovach
    0 references
    publication date
    28 January 2014
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    Euler graph
    0 references
    even graph
    0 references
    odd graph
    0 references
    treewidth
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C45
    0 references
    05C85
    0 references
    zbMATH DE Number
    6251116
    0 references
    OpenAlex ID
    W2154257407
    0 references
    Wikidata QID
    Q60488404
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q395000&oldid=33185228"
    Powered by MediaWiki