Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199612)9:4<359::AID-RSA2>3.0.CO;2-W" /><359::AID-RSA2>3.0.CO;2-W 10.1002/(SICI)1098-2418(199612)9:4<359::AID-RSA2>3.0.CO;2-WzbMath0881.05116OpenAlexW2073539635MaRDI QIDQ3123118

Hui Chen, Alan M. Frieze

Publication date: 6 March 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199612)9:4<359::aid-rsa2>3.0.co;2-w

zbMATH Keywords

parallel algorithmmaximal independent setrandom hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph