✦ LIBER ✦

Shortest paths in euclidean graphs

✍ Scribed by Robert Sedgewick; Jeffrey Scott Vitter

Book ID: 105325659
Publisher: Springer
Year: 1986
Tongue: English
Weight: 971 KB
Volume: 1
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01840435

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint shortest paths in graphs

✍ Hikoe Enomoto; Akira Saito 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

Shortest Paths in Reachability Graphs

✍ J. Desel; J. Esparza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Approximate shortest paths in weighted g

Approximate shortest paths in weighted graphs

✍ Raphael Yuster 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Shortest paths in fuzzy weighted graphs

✍ Chris Cornelis; Peter De Kesel; Etienne E. Kerre 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB

The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding op

Shortest Paths in Distance-regular Graph

Shortest Paths in Distance-regular Graphs

✍ Enrique Bendito; Angeles Carmona; Andrés M. Encinas 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Shortest paths on dynamic graphs

✍ Giacomo Nannicini; Leo Liberti 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB