✦ LIBER ✦

Shortest paths in networks with exponentially distributed arc lengths

✍ Scribed by V. G. Kulkarni

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 784 KB
Volume: 16
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230160303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths in stochastic networks wi

Shortest paths in stochastic networks with ARC lengths having discrete distributions

✍ Gehan A. Corea; Vidyadhar G. Kulkarni 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 688 KB

## Abstract In this work, we compute the distribution of __L__\*, the length of a shortest __(s, t)__ path, in a directed network __G__ with a source node __s__ and a sink node __t__ and whose arc lengths are independent, nonnegative, integer valued random variables having finite support. We constr

Minimal spanning trees in undirected net

Minimal spanning trees in undirected networks with exponentially distributed arc weights

✍ V. G. Kulkarni 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Computing k-shortest path lengths in euc

Computing k-shortest path lengths in euclidean networks

✍ Christopher C. Skiscim; Bruce L. Golden 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

Arc tolerances in shortest path and netw

Arc tolerances in shortest path and network flow problems

✍ D. R. Shier; Christoph Witzgall 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 752 KB

A note on Arc tolerances in sparse short

A note on Arc tolerances in sparse shortest-path and network flow problems

✍ Dan Gusfield 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 1 views

A mean-time comparison of algorithms for

A mean-time comparison of algorithms for the all-pairs shortest-path problem with arbitrary arc lengths

✍ W. D. Kelton; A. M. Law 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB