Properties of Labeling Methods for Determining Shortest Path Trees

DOI10.6028/JRES.086.013MaRDI QIDQ3914450zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

networksequence list

Mathematics Subject Classification ID

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)

Cited in

(12)

• Shortest path algorithms: A computational study with the C programming language
• A simple and fast label correcting algorithm for shortest paths
• Iterative algorithms for generating minimal cutsets in directed graphs
• Solving the nearly symmetric all-pairs shortest-path problem
• A note on the partitioning shortest path algorithm
• A heuristic improvement of the Bellman-Ford algorithm
• On the equivalence between some shortest path algorithms
• Complexity analysis and optimization of the shortest path tour problem
• On Some Special Network Flow Problems: The Shortest Path Tour Problems
• Time depending shortest-path problems with applications to railway networks
• Microcomputer-based algorithms for large scale shortest path problems
• Shortest paths algorithms: Theory and experimental evaluation

This page was built for publication: Properties of Labeling Methods for Determining Shortest Path Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914450)