Login / Signup

Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading.

Nikolaos FountoulakisAnna Huber
Published in: SIAM J. Discret. Math. (2009)
Keyphrases
  • scale free networks
  • random walk
  • directed acyclic graph
  • scale free
  • decision trees
  • directed graph
  • graph theory
  • weighted graph
  • graph databases
  • graph partitioning
  • stable set