A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005)

From MaRDI portal
Revision as of 16:32, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 1098603
Language Label Description Also known as
English
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
scientific article; zbMATH DE number 1098603

    Statements

    A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (English)
    0 references
    0 references
    0 references
    25 May 1998
    0 references
    0 references
    randomized parallel algorithm
    0 references