A note on parallel complexity of maximum \(f\)-matching (Q293199)

From MaRDI portal
Revision as of 21: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
A note on parallel complexity of maximum \(f\)-matching
scientific article

    Statements

    A note on parallel complexity of maximum \(f\)-matching (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2016
    0 references