| Article ID: | iaor19971028 |
| Country: | France |
| Volume: | 30 |
| Issue: | 4 |
| Start Page Number: | 333 |
| End Page Number: | 357 |
| Publication Date: | Oct 1996 |
| Journal: | RAIRO Operations Research |
| Authors: | Prins C. |
The paper reviews the algorithms available for computing shortest paths in large sparse graphs with non-negative weights. It then presents the results of a study comparing efficient