𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The shortest-path problem for graphs with random arc-lengths

✍ Scribed by A.M. Frieze; G.R. Grimmett

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
760 KB
Volume
10
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A shortest path problem on a network wit
A shortest path problem on a network with fuzzy arc lengths
✍ Shinkoh Okada; Timothy Soper πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 187 KB

We concentrate on a shortest path problem on a network in which a fuzzy number, instead of a real number, is assigned to each arc length. Introducing an order relation between fuzzy numbers based on "fuzzy min", a nondominated path or Pareto Optimal path from the speciΓΏed node to every other node is

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

Solving the all-pair shortest path query
Solving the all-pair shortest path query problem on interval and circular-arc graphs
✍ Chen, Danny Z.; Lee, D. T.; Sridhar, R.; Sekharan, Chandra N. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 3 views

In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed efficiently