Login / Signup
Very fast construction of bounded-degree spanning graphs via the semi-random graph process.
Omri Ben-Eliezer
Lior Gishboliner
Dan Hefetz
Michael Krivelevich
Published in:
SODA (2020)
Keyphrases
</>
graph theoretic
random graphs
bounded degree
clustering algorithm