Login / Signup

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks.

Omer AngelAbraham D. FlaxmanDavid B. Wilson
Published in: Comb. (2012)
Keyphrases
  • spanning tree
  • minimum spanning tree
  • steiner tree
  • edge disjoint
  • minimum cost
  • social networks
  • minimum spanning trees
  • search algorithm
  • upper bound
  • network structure
  • complex networks
  • graph theory
  • total length