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

Brodal, Gerth Stølting; Fagerberg, Rolf; Meyer, Ulrich; Zeh, Norbert; Hagerup, Torben; Katajainen, Jyrki

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

前へ次へ / 524933

公開

会議論文

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2A46-2

要旨

要旨はありません