English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing

MPS-Authors
/persons/resource/persons44076

Bast,  Holger
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44464

Funke,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45000

Matijevic,  Domagoj
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

Bast, H., Funke, S., & Matijevic, D. (2006). TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing. In 9th DIMACS Implementation Challenge --- Shortest Path. Piscataway, New Jersey: DIMACS.


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