Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science
Efficient algorithms for solving shortest paths on nearly acyclic directed graphs
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Solving shortest paths efficiently on nearly acyclic directed graphs
Theoretical Computer Science
Improved shortest path algorithms for nearly acyclic directed graphs
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Sharing information in all pairs shortest path algorithms
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sharing information in all pairs shortest path algorithms
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 0.00 |