March 1, 1976

New Bounds on the Complexity of the Shortest Path Problem

Key Points

Key points are not available for this paper at this time.

Abstract

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 03 January 1975Published online: 17 February 2012Keywordsgraph, shortest path, complexity, sorting, decision treePublication DataISSN (print): 0097-5397ISSN (online): 1095-7111Publisher: Society for Industrial and Applied MathematicsCODEN: smjcat

Mark Helpful

Bookmark

Relay

Cite This Study

Michael L. Fredman (Mon,) studied this question.

synapsesocial.com/papers/6a159918b2e0231f1582bbe0 https://doi.org/https://doi.org/10.1137/0205006

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$1973 · 98 citations
2A note on two problems in connexion with graphs1959 · 23,852 citations
3Partition of Space1943 · 57 citations
4Algorithm 97: Shortest path1962 · 4,027 citations
5Efficient determination of the transitive closure of a directed graph1971 · 193 citations

Mark Helpful

Bookmark

Relay