๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Paths with minimum range and ratio of arc lengths

โœ Scribed by Pierre Hansen; Giovanni Storchi; Tsevi Vovor

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
866 KB
Volume
78
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex s to a vertex 1 with the smallest possible range of arc lengths. and MINRATIO, i.e., find such a path for which the ratio of the largest to the smallest arc length is minimum. Several bicriterion extensions of these problems are also considered.

๐Ÿ“œ 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

Partitions of a graph into paths with pr
Partitions of a graph into paths with prescribed endvertices and lengths
โœ Hikoe Enomoto; Katsuhiro Ota ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 95 KB ๐Ÿ‘ 3 views

For a graph G, let ' 2 (G ) denote the minimum degree sum of a pair of nonadjacent vertices. We conjecture that if |V(G)| n i 1 k a i and ' 2 (G ) ! n k ร€ 1, then for any k vertices v 1 , v 2 , F F F , v k in G, there exist vertex-disjoint paths P 1 , P 2 , F F F , P k such that |V (P i )| a i and v