Parameterized and approximation algorithms for finding two disjoint matchings (Q300238)

From MaRDI portal
Revision as of 06:25, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized and approximation algorithms for finding two disjoint matchings
scientific article

    Statements

    Parameterized and approximation algorithms for finding two disjoint matchings (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed-parameter algorithms
    0 references
    approximation algorithms
    0 references
    color-coding
    0 references
    universal sets
    0 references
    matchings
    0 references
    0 references