Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research Units
Facilities
Projects
Research output
Search by expertise, name or affiliation
A fast and simple randomized parallel algorithm for the maximal independent set problem
Noga Alon
, László Babai, Alon Itai
Research output
:
Contribution to journal
›
Article
›
peer-review
511
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A fast and simple randomized parallel algorithm for the maximal independent set problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Maximal Independent Set
100%
Deterministic Algorithm
86%
Parallel Algorithms
84%
Randomized Algorithms
83%
Concurrent
56%
EREW PRAM
38%
Algorithm Analysis
36%
Combinatorial Analysis
34%
Combinatorial Algorithms
31%
Maximum Degree
24%
Pairwise
22%
Object
17%
Denote
15%
Graph in graph theory
11%
Model
8%