Weight of a link in a shortest path tree and the Dedekind Eta function

DOI10.1002/rsa.20299zbMath1209.05120OpenAlexW2037973262MaRDI QIDQ3055888

Piet Van Mieghem

Publication date: 10 November 2010

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:d82aee29-b057-4275-aac0-5c474745655c

zbMATH Keywords

shortest pathcomplete graphDedekind eta functionlink weights

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the value of a random minimum spanning tree problem
• A proof of Parisi's conjecture on the random assignment problem
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• The ?(2) limit in the random assignment problem
• Size and Weight of Shortest Path Trees with Exponential Link Weights
• The weight of the shortest path tree
• The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
• Constructive bounds and exact expectations for the random assignment problem
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• Performance Analysis of Communications Networks and Systems
• WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures

This page was built for publication: Weight of a link in a shortest path tree and the Dedekind Eta function