DeepAI AI Chat
Log In Sign Up

A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time

by   Dexin Li, et al.

In this paper we present a new algorithm called Raffica algorithm for Single Source Shortest Path. In random graph, this algorithm has Θ(M) time complexity. And for random grid graphs with Θ(N) hop-diameter, it is also linear. This algorithm can solve SSSP with arbitrary weights; when a negative cycle exists, this algorithm can find it out costing O(M). It means we can use it to solve random System of Difference Constraints fast as Θ(M) in expect. Using the idea, we can prove the expecting time complexity of queue optimized Bellman-Ford Algorithm, which is usually called SPFA, is Θ(MD) time complexity in expect, where D = O( N M/N) is the expecting hop-diameter, unlike the claim O(M) of Duan's.


page 1

page 2

page 3

page 4


Using Machine Learning Predictions to Speed-up Dijkstra's Shortest Path Algorithm

We study the use of machine learning techniques to solve a fundamental s...

Reachability and Shortest Paths in the Broadcast CONGEST Model

In this paper we study the time complexity of the single-source reachabi...

Improved Distributed Algorithms for Exact Shortest Paths

Computing shortest paths is one of the central problems in the theory of...

Around the diameter of AT-free graphs

A graph algorithm is truly subquadratic if it runs in O(m^b) time on con...

Parameterized Complexity of Diameter

Diameter--the task of computing the length of a longest shortest path---...

Boltzmann sampling of irreducible context-free structures in linear time

We continue our program of improving the complexity of so-called Boltzma...

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

In this work we revisit the fundamental Single-Source Shortest Paths (SS...