de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44447

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons44598

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-0010-11FD-A
Abstract
There is no abstract available