English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Single Shortest Path Algorithm for Graphs with Separators

MPS-Authors
/persons/resource/persons45021

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

Schmidt,  Bernd H.
Max Planck Society;

Karpinski,  Marek
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., & Schmidt, B. H. (1983). A Single Shortest Path Algorithm for Graphs with Separators. In Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983) (pp. 302-309). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AF32-E
Abstract
There is no abstract available