Volker Priebe

Learn More
We study the average-case complexity of shortest-paths problems in the vertexpotential 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(More)
We study both upper and lower bounds on the average-case complexity of shortestpaths algorithms. It is proved that the all-pairs shortest-paths problem on n-vertex networks can be solved in time O(n2 logn) with high probability with respect to various probability distributions on the set of inputs. Our results include the first theoretical analysis of the(More)
  • 1