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

DOI10.1007/BF01933647zbMATH Open0445.05061OpenAlexW2092199922MaRDI QIDQ3889092FDOQ3889092

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

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

Cites Work

• Title not available (Why is that?)
• A note on two problems in connexion with graphs
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Priority queues with update and finding minimum spanning trees

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

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