Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees (Q4291564)

From MaRDI portal
Revision as of 09:50, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 567053
Language Label Description Also known as
English
Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
scientific article; zbMATH DE number 567053

    Statements

    Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees (English)
    0 references
    0 references
    0 references
    0 references
    5 September 1994
    0 references
    matroid union
    0 references
    arborescences
    0 references
    edge-disjoint spanning trees
    0 references
    parallel algorithms
    0 references
    linearly representable matroids
    0 references
    randomization
    0 references

    Identifiers