✦ LIBER ✦

The shortest admissible paths. II

✍ Scribed by Yu. M. Ermol'cv; I. M. Mel'nik

Book ID: 105058940
Publisher: Springer US
Year: 1969
Tongue: English
Weight: 881 KB
Volume: 3
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01072848

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest admissible paths. I

✍ Yu. M. Ermol'ev 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 660 KB

Finding the k Shortest Paths

✍ Eppstein, David 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 416 KB

Scientific collaboration networks. II. S

Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality

✍ Newman, M. E. J. 📂 Article 📅 2001 🏛 The American Physical Society 🌐 English ⚖ 298 KB

Using computer databases of scientific papers in physics, biomedical research, and computer science, we have constructed networks of collaboration between scientists in each of these disciplines. In these networks two scientists are considered connected if they have coauthored one or more papers tog

Exploring the stratified shortest-paths

Exploring the stratified shortest-paths problem

✍ Timothy G. Griffin 📂 Article 📅 2011 🏛 Springer-Verlag ⚖ 981 KB

Updating of all the shortest paths

✍ Takashi Izumi; Yutaka Takahashi; Kenji Kawanishi 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

Finding the k shortest simple paths

✍ Hershberger, John; Maxel, Matthew; Suri, Subhash 📂 Article 📅 2007 🏛 Association for Computing Machinery 🌐 English ⚖ 340 KB