A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs

DOI10.1016/0020-0190(83)90120-5zbMath0506.68054OpenAlexW2072797026MaRDI QIDQ1836991

Chee-Keng Yap

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90120-5

zbMATH Keywords

graph algorithmparallel algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs

Cites Work

• Efficient Algorithms for Shortest Paths in Sparse Networks
• Unnamed Item

This page was built for publication: A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs