Nearly-perfect hypergraph packing is in NC (Q286955): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and covers in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More-than-nearly-perfect packings and partial designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank

Latest revision as of 02:06, 12 July 2024

scientific article
Language Label Description Also known as
English
Nearly-perfect hypergraph packing is in NC
scientific article

    Statements

    Nearly-perfect hypergraph packing is in NC (English)
    0 references
    0 references
    26 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    computational complexity
    0 references