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

From MaRDI portal
Revision as of 22:26, 19 June 2023 by Importer (talk | contribs) (‎Created a new 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