✦ LIBER ✦

Shortest Paths in Reachability Graphs

✍ Scribed by J. Desel; J. Esparza

Book ID: 102970592
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 727 KB
Volume: 51
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths in euclidean graphs

✍ Robert Sedgewick; Jeffrey Scott Vitter 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 971 KB

Disjoint shortest paths in graphs

✍ Hikoe Enomoto; Akira Saito 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 250 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