English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths

MPS-Authors
/persons/resource/persons44187

Brodal,  Gerth Stølting
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45038

Meyer,  Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45791

Zeh,  Norbert
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44564

Hagerup,  Torben
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

Brodal, G. S., Fagerberg, R., Meyer, U., & Zeh, N. (2004). Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In Algorithm theory, SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory; Humlebæk, Denmark, July 8-10, 2004; proceedings (pp. 480-492). Berlin, Germany: Springer.


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