Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.

Friedrich, Tobias; Hebbinghaus, Nils

doi:10.1007/978-3-540-92182-0_61

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.

MPS-Authors

/persons/resource/persons44447

Friedrich, Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44598

Hebbinghaus, Nils
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

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

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Friedrich, T., & Hebbinghaus, N. (2008). Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. In S.-H. Hong, H. Nagamochi, & T. Fukunaga (Eds.), Algorithms and Computation: 19th International Symposium, (pp. 693-704). New York, NY: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1B1F-F

Abstract

There is no abstract available