Parameterized complexity of connected even/odd subgraph problems (Q395000): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154257407 / rank
 
Normal rank

Revision as of 21:18, 19 March 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of connected even/odd subgraph problems
scientific article

    Statements

    Parameterized complexity of connected even/odd subgraph problems (English)
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    parameterized complexity
    0 references
    Euler graph
    0 references
    even graph
    0 references
    odd graph
    0 references
    treewidth
    0 references

    Identifiers