New Algorithm and Data Structures for the All Pairs Shortest Path Problem
In 1985, Moffat-Takaoka (MT) algorithm was developed to solve the all pairs shortest path (APSP) problem. This algorithm manages to get time complexity of O(n² log n) expected time when the end-point independent model of probabilistic assumption is used. However, the use of a critical point introduc...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Canterbury. Computer Science
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10092/8196 |