Graph Embedding through Random Walk for Shortest Paths Problems

DOI10.1007/978-3-642-04944-6_11MaRDI QIDQ3646123zbMATH OpenOpenAlexFDO

Authors Yakir Berchenko, Mina Teicher

Publication date 19 November 2009

Published in Stochastic Algorithms: Foundations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04944-6_11

zbMATH Keywords

graph embeddingshortest paths problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)

Recommendations

• scientific article; zbMATH DE number 7204478
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• On Shortest Paths in Graphs with Random Weights
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• The shortest-path problem for graphs with random arc-lengths

Cites work

• scientific article; zbMATH DE number 1256679 (Why is no real title available?)
• scientific article; zbMATH DE number 2006658 (Why is no real title available?)
• scientific article; zbMATH DE number 3297674 (Why is no real title available?)
• scientific article; zbMATH DE number 3333789 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• Analyzing Kleinberg's (and other) small-world models
• Computing almost shortest paths (extended abstract)
• Distance in random graphs with infinite mean degrees
• The small-world phenomenon: an algorithmic perspective
• Universal augmentation schemes for network navigability

This page was built for publication: Graph Embedding through Random Walk for Shortest Paths Problems

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