A randomized BSP/CGM algorithm for the maximal independent set problem

Parallel Processing Letters

Volumn 9, Issue 3, 1999, Pages 411-422

  Ferreira, Afonso ^a,b   Schabanel, Nicolas ^a  

^a INRIA   (France)

^b CNRS   (France)

Author keywords

BSP; CGM; Coarse graiaed models; Graph algorithms; Maximal independent set; p quantiles search; Parallel algorithms; Randomized algorithms; Sorting

Indexed keywords

COMPUTER SIMULATION; CONFORMAL MAPPING; GRAPH THEORY; PROBABILITY; SET THEORY; SORTING;

BULK SYNCHRONOUS PARALLEL APPROACH; COARSE GRAINED MULTICOMPUTER MODELS; GRAPH ALGORITHMS; MAXIMAL INDEPENDENT SET; QUANTILES SEARCH; RANDOMIZED ALGORITHMS;

PARALLEL ALGORITHMS;

EID: 0033189203     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626499000384     Document Type: Article

References (2)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7:567-583, 1986.
2. R. J. Anderson and L, Snyder. A comparison of shared and nonshared memory models of computation. Proceedings of the IEEE, 79(4):480-487,1997.