On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs

DOI10.1016/0020-0190(78)90007-8zbMath0398.05052OpenAlexW2020556531MaRDI QIDQ1254332

Could not fetch data.

Publication date: 1978

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90007-8

Mathematics Subject Classification ID

Could not fetch data.