✦ LIBER ✦

The expected length of a shortest path

✍ Scribed by Robert Davis; Armand Prieditis

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 568 KB
Volume: 46
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90059-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A theorem on the expected complexity of

A theorem on the expected complexity of dijkstra's shortest path algorithm

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 433 KB

Inapproximability results for the invers

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

✍ Andreas Bley 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th

Complexity of some inverse shortest path

Complexity of some inverse shortest path lengths problems

✍ Tingting Cui; Dorit S. Hochbaum 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB

A note on the expected path length of tr

A note on the expected path length of trees with known fringe

✍ Roberto De Prisco; Giuseppe Parlati; Giuseppe Persiano 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 480 KB

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

Estimation and determination of shortest

Estimation and determination of shortest path length in a road network with obstacles

✍ Nicolas Dubois; Frédéric Semet 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 798 KB