Skip to main content
SpringerLink
Log in

Simpler Computation of Single-Source Shortest Paths in Linear Average Time

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Meyer as well as Goldberg recently described algorithms that solve the single-source shortest-paths problem in linear average time on graphs with random edge lengths drawn from the uniform distribution on [0,1]. This note points out that the same result can be obtained through simple combinations of standard data structures and with a trivial probabilistic analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut fur Informatik, Universitat Augsburg, D-86135 Augsburg, Germany

    Torben Hagerup

Authors
  1. Torben Hagerup
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Torben Hagerup.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hagerup, T. Simpler Computation of Single-Source Shortest Paths in Linear Average Time. Theory Comput Syst 39, 113–120 (2006). https://doi.org/10.1007/s00224-005-1260-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1260-0

Keywords

Search

Navigation