A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths

DOI10.1007/BF01933647zbMath0445.05061OpenAlexW2092199922MaRDI QIDQ3889092

Sukhamay Kundu

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933647

zbMATH Keywords

algorithmshortest pathdigraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• A note on two problems in connexion with graphs
• Priority queues with update and finding minimum spanning trees
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Unnamed Item

This page was built for publication: A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths