English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Thesis

Average-case Complexity of Shortest-paths Problems

MPS-Authors
/persons/resource/persons45222

Priebe,  Volker
Algorithms and Complexity, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;

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

Priebe, V. (2001). Average-case Complexity of Shortest-paths Problems. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-25863.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-310A-5
Abstract
There is no abstract available