Kürzeste Wege in Netzwerken zwischen festen Knoten.

Author(s)
Pape, U.
Year
Abstract

The author discusses various methods of determining the shortest distances between fixed points in a given network and the use of algorithms is recommended since they can be implemented directly by computer. The solutions can be successfully applied to route selection in urban networks.

Request publication

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

Publication

Library number
B 1943 (In: B 1941) /71/
Source

In: Vorträge im Arbeitsseminar, Technische Universität, Braunschweig, 16 Juli 1971 : Mathematische Modelle-Verkehr und Städtebau-Verfahren und Anwendungen auf DV-Anlagen, Veröffentlichungen des Instituts für Stadtbauwesen, Heft 7, 1971, p. 25-53, 9 fig., 9 tab., 5 ref.

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.