An overview of computational complexity
Communications of the ACM
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A parallel algorithm for the maximal path problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel processing for efficient subdivision search
SCG '87 Proceedings of the third annual symposium on Computational geometry
Using smoothness to achieve parallelism
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Localizing Failures in Distributed Synchronization
IEEE Transactions on Parallel and Distributed Systems
Parallel search for maximal independence given minimal dependence
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm that finds independent sets of guaranteed size
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient Parallel Pseudo-Random Number Generation
CRYPTO '85 Advances in Cryptology
Formula dissection: A parallel algorithm for constraint satisfaction
Computers & Mathematics with Applications
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A new parallel algorithm for the maximal independent set problem
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Simplification of FEM-models on cell BE
MMCS'08 Proceedings of the 7th international conference on Mathematical Methods for Curves and Surfaces
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Greedy sequential maximal independent set and matching are parallel on average
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Information and Computation
Hi-index | 0.00 |
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/log n)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.