Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

A Simple Parallel Algorithm for the Maximal Independent Set Problem

Michael Luby · SIAM Journal on Computing · 1986 · 1.1K citations

Computing, Computer Science, Algorithms +12

Locality in Distributed Graph Algorithms

Nathan Linial · SIAM Journal on Computing · 1992 · 885 citations

Computing, Computer Science, Algorithms +12

A fast and simple randomized parallel algorithm for the maximal independent set problem

Noga Alon, László Babai, Alon Itai · Journal of Algorithms · 1986 · 842 citations

Computing, Computer Science, Mathematics +13

Decomposition of Finite Graphs Into Forests

C. St. J. A. Nash‐Williams · Journal of the London Mathematical Society · 1964 · 462 citations

Natural Sciences, Biology, Graph Visualization +5

Families of finite sets in which no set is covered by the union ofr others

P. Erdös, Péter Frankl, Zoltán Füredi · Israel Journal of Mathematics · 1985 · 444 citations

Natural Sciences, Mathematics, Combinatorics +10