The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
From MaRDI portal
Publication:3527542
DOI10.1017/S0963548308009176zbMath1159.05047MaRDI QIDQ3527542
Piet Van Mieghem, Gerard Hooghiemstra
Publication date: 29 September 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548308009176
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C38: Paths and cycles
Related Items
Weight of a link in a shortest path tree and the Dedekind Eta function, The Longest Minimum-Weight Path in a Complete Graph
Cites Work
- Unnamed Item
- The flooding time in random graphs
- FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Performance Analysis of Communications Networks and Systems
- WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m