All-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs
Data Structures and Algorithms
2013-08-08 v1
Abstract
Here the All-pairs shortest path problem on weighted undirected sparse graphs is being considered. For the problem considered, we propose ``disassembly and assembly of a graph'' algorithm which uses a solution of the problem on a small-dimensional graph to obtain the solution for the given graph. The proposed algorithm has been compared to one of the fastest classic algorithms on data from an open public source.
Cite
@article{arxiv.1308.1568,
title = {All-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs},
author = {Urakov and Timeryaev},
journal= {arXiv preprint arXiv:1308.1568},
year = {2013}
}
Comments
8 pages, 3 figures, 2 tables. A more detailed text on Russian: http://www.lib.tsu.ru/mminfo/000349342/19/image/19-084.pdf