A fast and simple randomized parallel algorithm for the maximal independent set problem
Authors:
- Noga AlonNANoga Alon
- László BabaiLBLászló Babai
- Alon ItaiAIAlon Itai
- 1 December 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (4) , 567-583
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Application of Graph Theory to Additive Number TheoryEuropean Journal of Combinatorics, 1985
- Sidon Sets in Groups and Induced Subgraphs of Cayley GraphsEuropean Journal of Combinatorics, 1985
- An overview of computational complexityCommunications of the ACM, 1983
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- Intersection theorems with geometric consequencesCombinatorica, 1981
- Pairwise Independent Random VariablesThe Annals of Probability, 1980
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974
- Pairwise Statistical IndependenceThe Annals of Mathematical Statistics, 1965
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947