English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Average-case complexity of single-source shortest-path algorithms: lower and upper bounds

MPS-Authors
/persons/resource/persons45038

Meyer,  Ulrich
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

Meyer, U. (2003). Average-case complexity of single-source shortest-path algorithms: lower and upper bounds. Journal of Algorithms, 48, 91-134.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2C5F-D
Abstract
There is no abstract available