Login / Signup

Very fast construction of bounded-degree spanning graphs via the semi-random graph process.

Omri Ben-EliezerLior GishbolinerDan HefetzMichael Krivelevich
Published in: SODA (2020)
Keyphrases
  • graph theoretic
  • random graphs
  • bounded degree
  • clustering algorithm