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

Cooper, Colin; Frieze, Alan M.; Mehlhorn, Kurt; Priebe, Volker

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

MPS-Authors

Frieze, Alan M.
Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45222

Priebe, Volker
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Cooper, C., Frieze, A. M., Mehlhorn, K., & Priebe, V. (2000). Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. Random Structures & Algorithms, 16, 33-46.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-3334-8

要旨

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^2)$ expected time, and the all-pairs shortest-paths problem can be solved in $O(n^2 \log n)$ expected time.