Results

**1 - 2**of**2**### families: a unified approach ✩

, 2002

"... www.elsevier.com/locate/jalgor Estimating all pairs shortest paths in restricted graph ..."

Abstract
- Add to MetaCart

www.elsevier.com/locate/jalgor Estimating all pairs shortest paths in restricted graph

### The 25th Workshop on Combinatorial Mathematics and Computation Theory The Weighted All-Pairs-Shortest-Path-Length Problem on Two-Terminal Series-Parallel Graphs

"... Let G(V, E) be a n-vertex graph with V = { v1 vn} and each edge e = ( i, ) is associated with two real weights, W ( → ) and W ( →). v v j v v v v Let P be a path from any source vertex s to any destination vertex d and assume that P is s = u → u2 ut i = d, t ≥ 2. The length of P, denoted by Len(P ..."

Abstract
- Add to MetaCart

Let G(V, E) be a n-vertex graph with V = { v1 vn} and each edge e = ( i, ) is associated with two real weights, W ( → ) and W ( →). v v j v v v v Let P be a path from any source vertex s to any destination vertex d and assume that P is s = u → u2 ut i = d, t ≥ 2. The length of P, denoted by Len(P), is defined as ∑ →. ( W u u j t−1 j=