Sciweavers

CPC
2010
122views more  CPC 2010»
13 years 11 months ago
The Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
Louigi Addario-Berry, Nicolas Broutin, Gábo...