𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On paths with the shortest average arc length in weighted graphs

✍ Scribed by Shmuel Wimer; Israel Koren; Israel Cederbaum

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
749 KB
Volume
45
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

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

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