The Longest Minimum-Weight Path in a Complete Graph (Q3557522): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gábor Lugosi / rank
Normal rank
 
Property / author
 
Property / author: Gábor Lugosi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0809.0275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the heights of random recursive trees and random <i>m</i>‐ary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on Stirling's Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation inequalities on some partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching processes in the analysis of the heights of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weight of the shortest path tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and Weight of Shortest Path Trees with Exponential Link Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights / rank
 
Normal rank

Revision as of 18:52, 2 July 2024

scientific article
Language Label Description Also known as
English
The Longest Minimum-Weight Path in a Complete Graph
scientific article

    Statements