Properties of Labeling Methods for Determining Shortest Path Trees
From MaRDI portal
Publication:3914450
DOI10.6028/jres.086.013zbMath0463.68061OpenAlexW2005199432MaRDI QIDQ3914450
Christoph Witzgall, Douglas R. Shier
Publication date: 1981
Published in: Journal of Research of the National Bureau of Standards (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.086.013
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items
A heuristic improvement of the Bellman-Ford algorithm, A note on the partitioning shortest path algorithm, On the equivalence between some shortest path algorithms, A simple and fast label correcting algorithm for shortest paths, On Some Special Network Flow Problems: The Shortest Path Tour Problems, Shortest paths algorithms: Theory and experimental evaluation, Time depending shortest-path problems with applications to railway networks, Iterative algorithms for generating minimal cutsets in directed graphs, Shortest path algorithms: A computational study with the C programming language, Complexity analysis and optimization of the shortest path tour problem, Solving the Nearly Symmetric All-Pairs Shortest-Path Problem, Microcomputer-based algorithms for large scale shortest path problems
