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

@article{Alon1985AFA,
  title={A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem},
  author={Noga Alon and L{\'a}szl{\'o} Babai and Alon Itai},
  journal={J. Algorithms},
  year={1985},
  volume={7},
  pages={567-583}
}
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

Citations

Publications citing this paper.
SHOWING 1-10 OF 386 CITATIONS

Direction aware cluster-based multi channel MAC protocol for vehicular ad hoc networks

  • 2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
  • 2015
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Hard Problems on Layered Graphs: Parallel Algorithms and Improvements

  • 2018 IEEE 8th International Advance Computing Conference (IACC)
  • 2018
VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

What can be sampled locally?

  • Distributed Computing
  • 2017
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Algorithmic Learning Theory

  • Lecture Notes in Computer Science
  • 2016
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Algorithms for Fundamental Problems in Computer Networks.

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

OBDDs and (Almost) $k$-wise Independent Random Variables

  • ArXiv
  • 2015
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On graph algorithms for large-scale graphs

VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

H-wise independence

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1987
2019

CITATION STATISTICS

  • 49 Highly Influenced Citations

  • Averaged 32 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

BABAI AND VERA T . S 6 s , Sidon sets in groups and induced subgraphs of Cayley graphs

L. VW
  • European J . Combin .
  • 1985

GOLDREICH, On the power of two points based sampling, preprint

B. CHOR
  • 1985

S6s, Sidon sets in groups and induced subgraphs of Cayley graphs

L. BABAI, T VERA
  • European J. Combin.,
  • 1985

SMOLENSKY, “The Bit Extraction Problem or r-Resilient Functions,

J. HASTAD, J. FRIEDMAN, S. RUDICH
  • Proc. 26th FOCS,
  • 1985

The Bit Extraction Problem or rResilient Functions

J. HASTAD GOLDREICH, S. RUDICH J. FRIEDMAN
  • 1985

The Theory of Error Correcting Codes

F. J. MACWILLIAMS AND N. J. A. SLOANE
  • 1985

WIGDERSON, “Deterministic Simulation of Probabilistic Constant Depth Circuits,

A. M. AJTAI
  • Proc. 26th FOCS,
  • 1985

ITAI, A fast and simple randomized parallel algorithm for maximal matching

A. A. ISRAELI
  • 1984

An overview of computational complexity

S. A. COOK
  • Comm. ACM
  • 1983