Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (Q1183464)

From MaRDI portal
Revision as of 15:48, 15 May 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
Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
scientific article

    Statements

    Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems (English)
    0 references
    28 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel complexity of matching
    0 references
    perfect matching
    0 references
    Las Vegas RNC algorithm
    0 references
    \(T\)-join problem
    0 references
    0 references