Graph Embedding through Random Walk for Shortest Paths Problems
From MaRDI portal
Publication:3646123
DOI10.1007/978-3-642-04944-6_11zbMath1260.90157OpenAlexW2114496166MaRDI QIDQ3646123
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
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance in random graphs with infinite mean degrees
- Universal augmentation schemes for network navigability
- The small-world phenomenon
- A critical point for random graphs with a given degree sequence
- Analyzing Kleinberg's (and other) small-world Models
- Computing almost shortest paths
This page was built for publication: Graph Embedding through Random Walk for Shortest Paths Problems