On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka

Mehlhorn, Kurt; Priebe, Volker

doi:10.1007/3-540-60313-1_143

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka

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;

External Resource

https://rdcu.be/dxvd1
(Publisher version)

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. (1995). On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. In Algorithms - ESA '95 (pp. 185-198). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC43-D

Abstract

There is no abstract available