Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model

Abstract

We study the average-case complexity of shortest-paths problems in the vertex-potential model. The vertex-potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths but without negative cycles. We show that on a graph with n vertices and with respect to this model, the single-source shortest-paths problem can be solved in O(n²) expected time, and the all-pairs shortest-paths problem can be solved in O(n² log n) expected time

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://www.aladdin.cs.cmu.edu/... (external link)