Some simple distributed algorithms for sparse networks

Locality in Distributed Graph Algorithms

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

Cluster Computing, Computational Complexity Theory, Engineering +20

Network decomposition and locality in distributed computation

Baruch Awerbuch, Michael Luby, Andrew V. Goldberg et al. · 1989 · 301 citations

Cluster Computing, Engineering, Distributed Algorithms +21

Low diameter graph decompositions

Nathan Linial, Michael J. Saks · COMBINATORICA · 1993 · 218 citations

Graph Minor, Network Science, Graph Theory +7

Parallel Symmetry-Breaking in Sparse Graphs

Andrew V. Goldberg, Serge Plotkin, Gregory E. Shannon · SIAM Journal on Discrete Mathematics · 1988 · 201 citations

Graph Sparsity, Engineering, Planar Graph +19

Parallel (Δ + 1)-coloring of constant-degree graphs

Andrew V. Goldberg, Serge Plotkin · Information Processing Letters · 1987 · 41 citations

Engineering, Graph Theory, Constant-degree Graphs +6