A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (Q1350189)

From MaRDI portal
Revision as of 01:48, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
scientific article

    Statements

    A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricity (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Maximal independent set
    0 references
    Hypergraph
    0 references
    Parallel algorithms
    0 references
    0 references