论文信息 - A Processor Efficient MIS Algorithm on Random Graphs

A Processor Efficient MIS Algorithm on Random Graphs

Abstract In this paper we present a randomized parallel algorithm for finding a maximal independent set in a random graph with n vertices in which the edges are chosen with probability p such that 2 (n−1)⩽p . The algorithm has O(log2n) expected time using only O(n) processors on the EREW PRAM model.

S. Lakshmivarahan | Sudarshan K. Dhall | S. B. Yang

[1] Uzi Vishkin,et al. Randomized speed-ups in parallel computation , 2015, STOC '84.

[2] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.

[3] Michal Karonski,et al. A review of random graphs , 1982, J. Graph Theory.

[4] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[5] Eli Upfal,et al. Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces , 1984, J. Algorithms.

[6] J. Reif,et al. The Expected Time Complexity of Parallel Graph and Digraph Algorithms. , 1982 .

[7] Richard M. Karp,et al. A fast parallel algorithm for the maximal independent set problem , 1985, JACM.

[8] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[9] Béla Bollobás,et al. Random Graphs , 1985 .

[10] Prabhakar Raghavan,et al. Parallel graph algorithms that are efficient on average , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).