The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

DOI10.1017/S0963548308009176zbMath1159.05047OpenAlexW2139815643MaRDI 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

zbMATH Keywords

pathweighthopcount

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (2)

The Longest Minimum-Weight Path in a Complete Graph ⋮ Weight of a link in a shortest path tree and the Dedekind Eta function

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

This page was built for publication: The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights