Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209)

From MaRDI portal
Revision as of 17:26, 19 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57359876, #quickstatements; #temporary_batch_1710865376617)
scientific article
Language Label Description Also known as
English
Faster fixed-parameter tractable algorithms for matching and packing problems
scientific article

    Statements

    Faster fixed-parameter tractable algorithms for matching and packing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2008
    0 references
    parameterized complexity
    0 references
    fixed parameter tractable
    0 references
    graph matching
    0 references
    set packing
    0 references
    color coding
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references