Average-case complexity of single-source shortest-path algorithms: lower and 
upper bounds

Local TagsRelease HistoryDetailsSummary

Average-case complexity of single-source shortest-path algorithms: lower and upper bounds

Meyer, U. (2003). Average-case complexity of single-source shortest-path algorithms: lower and upper bounds. Journal of Algorithms, 48, 91-134.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C5F-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C60-7

Genre: Journal Article

show

show

hide

Creators:
Meyer, Ulrich¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): eng - English

Dates: Modified: 2004-06-15Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 201937
Other: Local-ID: C1256428004B93B8-1D9EA287DEE4A889C1256D1F003847DB-Meyer2003

Degree: -

show

show

show

show

hide

Title: Journal of Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 48 Sequence Number: - Start / End Page: 91 - 134 Identifier: ISSN: 0196-6774