English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3334-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3335-6
Genre: Journal Article

Files

show Files
hide Files
:
mehlhorn128.pdf (Any fulltext), 10MB
 
File Permalink:
-
Name:
mehlhorn128.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Cooper, Colin, Author
Frieze, Alan M.1, Author
Mehlhorn, Kurt2, Author           
Priebe, Volker2, Author           
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

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

Details

show
hide
Language(s): eng - English
 Dates: 2006-08-302000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344432
Other: Local-ID: C1256428004B93B8-3661E3997B3C672A4125684E0045AF9E-CooperFriezeMehlhornPriebe00
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Random Structures & Algorithms
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 16 Sequence Number: - Start / End Page: 33 - 46 Identifier: ISSN: 1042-9832