Conference Proceedings
An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem
T Takaoka, A Moffat
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Published : 1980
DOI: 10.1007/BFb0022539