A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time
Data Structures and Algorithms
2018-09-19 v4
Abstract
In this paper, I present an algorithm called Raffica algorithm for Single-Source Shortest Path(SSSP). On random graph, this algorithm has linear time complexity(in expect). More precisely, the random graph uses configuration model, and the weights are distributed mostly positively. It is also linear for random grid graphs. Despite I made an assumption on the weights of the random graph, this algorithm is able to solve SSSP with arbitrary weights; when a negative cycle exists, this algorithm can find it out once traversed. The algorithm has a lot of appliances.
Cite
@article{arxiv.1808.02591,
title = {A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time},
author = {Dexin Li},
journal= {arXiv preprint arXiv:1808.02591},
year = {2018}
}
Comments
Proved theoretically