✦ LIBER ✦

Shortest Path Problems on a Polyhedral Surface

✍ Scribed by Atlas F. Cook IV, Carola Wenk

Book ID: 120910043
Publisher: Springer
Year: 2012
Tongue: English
Weight: 754 KB
Volume: 69
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9723-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating Shortest Paths on Weighted

Approximating Shortest Paths on Weighted Polyhedral Surfaces

✍ M. Lanthier; A. Maheshwari; J. -R. Sack 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 689 KB

Exact Geodesics and Shortest Paths on Po

Exact Geodesics and Shortest Paths on Polyhedral Surfaces

✍ Balasubramanian, M.; Polimeni, J.R.; Schwartz, E.L. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 1004 KB

On a multicriteria shortest path problem

✍ Ernesto Queirós Vieira Martins 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 617 KB

On Dynamic Shortest Paths Problems

✍ Liam Roditty; Uri Zwick 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 702 KB

A note on k-shortest paths problem

✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

On Bounded Leg Shortest Paths Problems

✍ Liam Roditty; Michael Segal 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 538 KB