scientific article; zbMATH DE number 432767

MaRDI QIDQ3138895zbMATH OpenFDO

Authors Michael Luby, Paul Beame

Publication date 19 September 1994

zbMATH Keywords

parallel searchmaximal independencerandomized NC algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Distributed algorithms (68W15)

Cited in

(5)

• Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set
• On subgraphs of bounded degeneracy in hypergraphs
• On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
• A global parallel algorithm for the hypergraph transversal problem
• An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138895)