Efficient Algorithms for Shortest Paths in Sparse Networks.
Donald B. Johnson:
Efficient Algorithms for Shortest Paths in Sparse Networks.
J. ACM 24(1): 1-13(1977)@article{DBLP:journals/jacm/Johnson77,
author = {Donald B. Johnson},
title = {Efficient Algorithms for Shortest Paths in Sparse Networks},
journal = {J. ACM},
volume = {24},
number = {1},
year = {1977},
pages = {1-13},
ee = {db/journals/jacm/Johnson77.html, http://doi.acm.org/10.1145/321992.321993},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- Bin Jiang:
I/O-Efficiency of Shortest Path Algorithms: An Analysis.
ICDE 1992: 12-19
BibTeX
Copyright © Sun May 17 00:05:26 2009
by Michael Ley (ley@uni-trier.de)