New Bounds on the Complexity of the Shortest Path Problem 论文
1976SIAM Journal on Computing引用 264
Complexity and Algorithms in GraphsOptimization and Search ProblemsAdvanced Graph Theory Research
摘要
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