Computer Science and Information Technology Vol. 1(3), pp. 233 - 237
DOI: 10.13189/csit.2013.010309
Reprint (PDF) (102Kb)

All-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs

Urakov A. R. , Timeryaev T. V. ^*
General Scientific Faculty, Ufa State Aviation Technical University, Ufa, 450077, Bashkortostan, Russia

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.

KEYWORDS
APSP, graph disassembly, graph assembly, graph contraction, sparse graphs

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Urakov A. R. , Timeryaev T. V. , "All-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs," Computer Science and Information Technology, Vol. 1, No. 3, pp. 233 - 237, 2013. DOI: 10.13189/csit.2013.010309.

(b). APA Format:
Urakov A. R. , Timeryaev T. V. (2013). All-Pairs Shortest Paths Algorithm for High-dimensional Sparse Graphs. Computer Science and Information Technology, 1(3), 233 - 237. DOI: 10.13189/csit.2013.010309.