## SEMIRING FRAMEWORKS AND ALGORITHMS FOR SHORTEST-DISTANCE PROBLEMS (2002)

### Cached

### Download Links

Citations: | 72 - 20 self |

### BibTeX

@MISC{Mohri02semiringframeworks,

author = {Mehryar Mohri},

title = { SEMIRING FRAMEWORKS AND ALGORITHMS FOR SHORTEST-DISTANCE PROBLEMS},

year = {2002}

}

### OpenURL

### Abstract

We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances in a weighted directed graph when the weights satisfy the conditions of our general semiring framework. The same algorithm can be used to solve efficiently classical shortest paths problems or to find the k-shortest distances in a directed graph. It can be used to solve single-source shortest-distance problems in weighted directed acyclic graphs over any semiring. We examine several semirings and describe some specific instances of our generic algorithms to illustrate their use and compare them with existing methods and algorithms. The proof of the soundness of all algorithms is given in detail, including their pseudocode and a full analysis of their running time complexity.