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 language | English |
---|---|
Title of host publication | Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC 1984 |
Publisher | Association for Computing Machinery |
Pages | 266-272 |
Number of pages | 7 |
ISBN (Electronic) | 0897911334 |
DOIs | |
State | Published - 1 Dec 1984 |
Externally published | Yes |
Event | 16th Annual ACM Symposium on Theory of Computing, STOC 1984 - Washington, United States Duration: 30 Apr 1984 → 2 May 1984 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
ISSN (Print) | 0737-8017 |
Conference
Conference | 16th Annual ACM Symposium on Theory of Computing, STOC 1984 |
---|---|
Country/Territory | United States |
City | Washington |
Period | 30/04/84 → 2/05/84 |
Bibliographical note
Publisher Copyright:© 1984 ACM.