𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast and simple randomized parallel algorithm for the maximal independent set problem

✍ Scribed by Noga Alon; László Babai; Alon Itai

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
920 KB
Volume
7
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of parallel algorithms for find
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
✍ H. Chen; A. M. Frieze 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study