A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

@article{Alon1986AFA,
  title={A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem},
  author={N. Alon and L. Babai and A. Itai},
  journal={J. Algorithms},
  year={1986},
  volume={7},
  pages={567-583}
}
  • N. Alon, L. Babai, A. Itai
  • Published 1986
  • Mathematics, Computer Science
  • J. Algorithms
  • Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is presented. Its expected running time on a concurrent-read concurrent-write PRAM with O (| E | d max ) processors is O (log n ), where d max denotes the maximum degree. On an exclusive-read exclusive-write PRAM with O (| E |) processors the algorithm runs in O (log 2 n ). Previously, an O (log 4 n ) deterministic algorithm was given by Karp and Wigderson for the EREW-PRAM… CONTINUE READING
    724 Citations
    An optimal bit complexity randomized distributed MIS algorithm
    • 89
    A randomized BSP/CGM algorithm for the maximal independent set problem
    • A. Ferreira, N. Schabanel
    • Computer Science
    • Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99)
    • 1999
    • 5
    Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs
    • 6
    • PDF
    An Improved Distributed Algorithm for Maximal Independent Set
    • 143
    • PDF
    An optimal maximal independent set algorithm for bounded-independence graphs
    • 50
    • PDF
    Deterministic Parallel Algorithms for Bilinear Objective Functions
    • 4
    • PDF
    Fast Distributed Algorithms for Connectivity and MST in Large Graphs
    • 1

    References

    SHOWING 1-10 OF 42 REFERENCES
    A fast parallel algorithm for the maximal independent set problem
    • 158
    • PDF
    A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
    • 212
    • PDF
    A simple parallel algorithm for the maximal independent set problem
    • M. Luby
    • Computer Science
    • STOC '85
    • 1985
    • 1,085
    • PDF
    Deterministic simulation of probabilistic constant depth circuits
    • M. Ajtai, A. Wigderson
    • Mathematics, Computer Science
    • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
    • 1985
    • 99
    • PDF
    Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs
    • 91
    • PDF
    Some remarks on the theory of graphs
    • 546
    • PDF
    An Application of Graph Theory to Additive Number Theory
    • 135
    • PDF
    The bit extraction problem or t-resilient functions
    • 362
    • PDF