Login / Signup

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

Omri Ben-EliezerLior GishbolinerDan HefetzMichael Krivelevich
Published in: Random Struct. Algorithms (2020)
Keyphrases
  • graph theoretic
  • random graphs
  • upper bound
  • bounded degree
  • lower bound
  • query processing
  • connected components
  • graph theory
  • small world