✦ LIBER ✦

Shortest path computations in source-deplanarized graphs

✍ Scribed by Greg N. Frederickson; Susanne E. Hambrusch; Hung-Yi Tu

Book ID: 107766147
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 485 KB
Volume: 47
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90227-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing sets of shortest paths in a

On computing sets of shortest paths in a graph

✍ Minieka, Edward 📂 Article 📅 1974 🏛 Association for Computing Machinery 🌐 English ⚖ 261 KB

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

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