DocumentCode :
2979519
Title :
A randomized BSP/CGM algorithm for the maximal independent set problem
Author :
Ferreira, Afonso ; Schabanel, Nicolas
Author_Institution :
CNRS, INRIA, Sophia Antipolis, France
fYear :
1999
fDate :
1999
Firstpage :
284
Lastpage :
289
Abstract :
This paper presents a randomized parallel algorithm for the Maximal Independent Set problem. Our algorithm uses a BSP-like computer with p processors and requires that n+m/p=Ω(p) for a graph with 72 vertices and m edges. Under this scalability assumption, and after a preprocessing phase, it computes a maximal independent set after O(log p) communication rounds, with high probability, each round requiring linear computation time O(n+p/p). The preprocessing phase is deterministic and important in order to ensure that degree computations can be implemented efficiently. For this, we give an optimal parallel BSP/CGM algorithm to the p-quantiles search problem, which runs in O(m log p/p) time and a constant number of communication rounds, and could be of interest in its own right, as shown in the text
Keywords :
computational geometry; parallel algorithms; randomised algorithms; search problems; sorting; communication rounds; maximal independent set problem; p-quantiles search problem; parallel algorithm; randomized BSP/CGM algorithm; scalability; Algorithm design and analysis; Communication networks; Computational modeling; Concurrent computing; Nominations and elections; Parallel algorithms; Phase change random access memory; Sorting; System recovery; User-generated content;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on
Conference_Location :
Perth/Fremantle, WA
ISSN :
1087-4089
Print_ISBN :
0-7695-0231-8
Type :
conf
DOI :
10.1109/ISPAN.1999.778953
Filename :
778953
Link To Document :
بازگشت