JavaScript is disabled for your browser. Some features of this site may not work without it.
Use of eCommons for rapid dissemination of COVID-19 research
In order to maximize the discoverability of COVID-19 research, and to conform with repository best practices and the requirements of publishers and research funders, we provide special guidance for COVID-19 submissions.
Algorithms for Shortest Paths
Abstract
New algorithms are presented for the general all pairs and single source shortest path problems and for the single source problem restricted to nonnegative arc weights. The new algorithms are faster on sparse networks than algorithms previously known. In addition, new results are presented on the behavior of well-known algorithms, two of which have exponential running times under surprisingly innocuous conditions.
Date Issued
1973-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-169
Type
technical report