Parameterized Complexity of Connected Even/Odd Subgraph Problems (Q2904782)

From MaRDI portal
Revision as of 09:02, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized Complexity of Connected Even/Odd Subgraph Problems
scientific article

    Statements

    author
    Fedor V. Fomin
    0 references
    Petr A. Golovach
    0 references
    publication date
    23 August 2012
    0 references
    zbMATH Keywords
    parameterized complexity
    0 references
    Euler graph
    0 references
    even graph
    0 references
    odd graph
    0 references
    treewidth
    0 references
    subgraph
    0 references
    title
    Parameterized Complexity of Connected Even/Odd Subgraph Problems (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C45
    0 references
    05C07
    0 references
    zbMATH DE Number
    6070922
    0 references
    OpenAlex ID
    W2266466481
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2904782&oldid=36996584"
    Powered by MediaWiki