English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles

MPS-Authors
/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45222

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

/persons/resource/persons45363

Schäfer,  Guido
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45498

Sivadasan,  Naveen
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

Mehlhorn, K., Priebe, V., Schäfer, G., & Sivadasan, N. (2002). All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles. Information Processing Letters, 81(6), 341-343. doi:10.1016/S0020-0190(01)00242-3.


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