In this note we present some computational evidence to suggest that a version of Bellman's shortest-path algorithm outperforms Treesort-Dijkstra's for a certain class of networks.
No takes yet. Share an insight, caveat, or question.
Bruce Golden (1976) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: