The shortest chains in a graph.

Author(s)
Sakarovitch, M.
Year
Abstract

Modal split and traffic assignment are both basic steps of a Y traffic study for which new approaches may imply the computation of the k shortest chains between an origin O and a destination D. In this paper an algorithm is given to find the K shortens chains in a graph G.

Request publication

16 + 0 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
A 2794 T
Source

Transportation Research, Vol. 2 (1968), No. 1 (March), p. 1-11

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.