Abstract
AbstractIn this paper we present an \({\tilde O}(W n^{\omega})\) time algorithm solving single source shortest path problem in graphs with integer weights from the set {–W,...,0,...,W}, where ω < 2.376 is the matrix multiplication exponent. For dense graphs with small edge weights, this result improves upon the algorithm of Goldberg that works in \({\tilde O}(mn^{0.5}{\rm log}W)\) time, and the Bellman-Ford algorithm that works in O(nm) time.KeywordsShort PathMatrix MultiplicationInteger WeightWeighted Directed GraphScaling AlgorithmThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
