Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230)

From MaRDI portal
Revision as of 22:59, 28 July 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
Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
scientific article

    Statements

    Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (English)
    0 references
    0 references
    0 references
    0 references
    30 May 1995
    0 references
    exact problems
    0 references
    disjoint cycles
    0 references
    perfect matchings
    0 references
    randomized parallel algorithms
    0 references

    Identifiers