The optimal path in an Erdős-Rényi random graph

MaRDI QIDQ3370778zbMATH OpenFDO

Authors Lidia A. Braunstein, Sameet Sreenivasan, Reuven Cohen, S. V. Buldyrev, Shlomo Havlin, H. Eugene Stanley

Publication date 8 February 2006

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Stochastic network models in operations research (90B15)

Recommendations

• Length of optimal path in random networks with strong disorder
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Weak disorder in the stochastic mean-field model of distance. II
• Weak disorder asymptotics in the stochastic mean-field model of distance
• First passage percolation on locally treelike networks. I. Dense random graphs

Cited in

(7)

• Percolation and best-choice problem for powers of paths
• Optimal Node Visitation in Stochastic Digraphs
• The total acquisition number of the randomly weighted path
• Length of optimal path in random networks with strong disorder
• Successive shortest paths in complete graphs with random edge weights
• scientific article; zbMATH DE number 1380616 (Why is no real title available?)
• Extremal paths in inhomogenous random graphs

This page was built for publication: The optimal path in an Erdős-Rényi random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370778)