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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3003675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions / rank
 
Normal rank

Latest revision as of 09:36, 4 July 2024

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
    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