Sciweavers

41 search results - page 1 / 9
» Cache-oblivious priority queue and graph algorithm applicati...
Sort
View
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
13 years 10 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
SPAA
2004
ACM
13 years 11 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
STOC
2002
ACM
81views Algorithms» more  STOC 2002»
14 years 5 months ago
Cache-oblivious priority queue and graph algorithm applications
Lars Arge, Michael A. Bender, Erik D. Demaine, Bry...
INFOCOM
2007
IEEE
13 years 11 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin