English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

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. (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.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-11FD-A
Abstract
There is no abstract available