Improvements for the thresh X2 shortest path algorithm

DOI10.1016/0167-6377(87)90053-8zbMath0628.90088OpenAlexW2024813706MaRDI QIDQ1093560

James J. Divoky

Publication date: 1987

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(87)90053-8

zbMATH Keywords

shortest path algorithmsrandom networksthresh X2 algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (1)

The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm

Cites Work

• A New Polynomially Bounded Shortest Path Algorithm
• New Polynomial Shortest Path Algorithms and Their Computational Attributes

This page was built for publication: Improvements for the thresh X2 shortest path algorithm