A fast parallel algorithm for the maximal independent set problem

Richard M. Karp, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

66 Scopus citations

Abstract

A parallel algorithm is presented which accepts as input a graph G and produces a maximal independent set of vertices in G. On a P-RAM without the concurrent write or concurrent read features, the algorithm executes in O((log n) 4) time and uses O((n/logn)3) processors, where n is the number of vertices in G. The algorithm has several novel features that may find other applications. These include the use of balanced incomplete block designs to replace random sampling by deterministic sampling, and the use of a "dynamic pigeonhole principle" that generalizes the conventional pigeonhole principle.

Original languageEnglish
Title of host publicationProceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984
PublisherAssociation for Computing Machinery
Pages266-272
Number of pages7
ISBN (Electronic)0897911334
DOIs
StatePublished - 1 Dec 1984
Externally publishedYes
Event16th Annual ACM Symposium on Theory of Computing, STOC 1984 - Washington, United States
Duration: 30 Apr 19842 May 1984

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference16th Annual ACM Symposium on Theory of Computing, STOC 1984
Country/TerritoryUnited States
CityWashington
Period30/04/842/05/84

Bibliographical note

Publisher Copyright:
© 1984 ACM.

Fingerprint

Dive into the research topics of 'A fast parallel algorithm for the maximal independent set problem'. Together they form a unique fingerprint.

Cite this