Average Update times for Fully-dynamic All-pairs Shortest Paths

Friedrich, Tobias; Hebbinghaus, Nils

doi:10.1016/j.dam.2011.02.007

Local TagsRelease HistoryDetailsSummary

Average Update times for Fully-dynamic All-pairs Shortest Paths

Friedrich, T., & Hebbinghaus, N. (2011). Average Update times for Fully-dynamic All-pairs Shortest Paths. Discrete Applied Mathematics, 159(16), 1751-1758. doi:10.1016/j.dam.2011.02.007.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0010-11FD-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-0515-4

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Friedrich, Tobias¹, Author
Hebbinghaus, Nils¹, Author

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

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2011Date issued: 2011

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 618749
DOI: 10.1016/j.dam.2011.02.007
URI: http://dx.doi.org/10.1016/j.dam.2011.02.007
Other: Local-ID: C1256428004B93B8-D0D49A4F9FF543E8C12579CA00370D93-FriedrichDAM2011

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Discrete Applied Mathematics

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 159 (16) Sequence Number: - Start / End Page: 1751 - 1758 Identifier: ISSN: 0166-218X