An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086)

From MaRDI portal
Revision as of 21:52, 14 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
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
scientific article

    Statements

    An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    parallel algorithms
    0 references
    computational complexity
    0 references
    maximal independent set
    0 references
    hypergraph
    0 references
    NC algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references