1 paper · 1 filter
Michael Krivelevich, Tamás Mészáros, Peleg Michaeli +1
The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the c…