✦ LIBER ✦

Shortest paths between shortest paths

✍ Scribed by Marcin Kamiński; Paul Medvedev; Martin Milanič

Book ID: 113927411
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 252 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest path between two simple polygon

Shortest path between two simple polygons

✍ Takao Asano; Tetsuo Asano; Hiroshi Imai 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 267 KB

On the equivalence between some shortest

On the equivalence between some shortest path algorithms

✍ Hanif D. Sherali 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Shortest paths between regular states of

Shortest paths between regular states of the Tower of Hanoi

✍ Andreas M. Hinz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Time and space efficient algorithms for

Time and space efficient algorithms for shortest paths between convex polygons

✍ Hans Rohnert 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On variants of shortest-path betweenness

On variants of shortest-path betweenness centrality and their generic computation

✍ Ulrik Brandes 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of

Order relation between intervals and its

Order relation between intervals and its application to shortest path problem

✍ Shinkoh Okada; Mitsuo Gen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 292 KB