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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3111, Issue , 2004, Pages 480-492

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^b   Meyer, Ulrich ^c   Zeh, Norbert ^d  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; DATA STRUCTURES; GRAPH THEORY;

BREADTH-FIRST SEARCH; CACHE-OBLIVIOUS; PERFORMANCE GAPS; PRIORITY QUEUES; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SINGLE SOURCE SHORTEST PATH PROBLEMS; UNDIRECTED GRAPH;

ALGORITHMS;

EID: 35048892533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_41     Document Type: Article

References (22)

1. J. Abello, A. L. Buchsbaum, and J. R. Westbrook. A functional approach to external graph algorithms. Algorithmica, 32(3):437-458, 2002.
2. A. Aggarwal and J.S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, Sept. 1988.
3. L. Arge. External memory data structures. In Proc. 9th Annual European Symposium on Algorithms, volume 2161 of LNCS, pages 1-29. Springer, 2001.
4. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In Proc. 34th STOC, pages 268-276. ACM, 2002.
5. L. Arge, G. Brodal, and L. Toma. On external-memory MST, SSSP and multiway planar graph separation. In Proc. 8th SWAT, volume 1851 of LNCS, pages 433-447. Springer, 2000.
6. G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th ICALP, volume 2380 of LNCS, pages 426-438. Springer, 2002.
7. G. S. Brodal and R. Fagerberg. Funnel heap - a cache oblivious priority queue. In Proc. 13th ISAAC, volume 2518 of LNCS, pages 219-228. Springer, 2002.
8. G. S. Brodal and R. Fagerberg. On the limits of cache-obliviousness. In Proc. 35th Symposium on Theory of Computing, pages 307-315. ACM Press, 2003.
9. G. S. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. Technical Report BRICS-RS-04-2, BRICS, Dept. of C. S., University of Aarhus, Jan 2004.
10. A. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In Proc. 11th SODA, pages 859-860. ACM, 2000.
11. Y. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149. ACM, 1995.
12. R. A. Chowdhury and V. Ramachandran. Cache-oblivious shortest paths in graphs using buffer heap. In Proc. 16th SPAA. ACM-SIAM, 2004. To appear.
13. E. D. Demaine. Cache-oblivious data structures and algorithms. In Proc. EFF summer school on massive data sets, LNCS. Springer, 2004, to appear.
14. E. W. Dijkstra. A note on two problems in connexion with graphs. Num. Math., 1:269-271, 1959.
15. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
16. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In 40th FOCS, pages 285-297. IEEE, 1999.
17. V. Kumar and E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. In Proc. 8th SPDP, pages 169-177. IEEE, 1996.
18. K. Mehlhorn and U. Meyer. External-memory breadth-first search with sublinear I/O. In Proc. 10th ESA, volume 2461 of LNCS, pages 723-735. Springer, 2002.
19. U. Meyer, P. Sanders, and J. F. Sibeyn, editors. Algorithms for Memory Hierarchies, volume 2625 of LNCS. Springer, 2003.
20. U. Meyer and N. Zeh. I/O-efficient undirected shortest paths. In Proc. 11th ESA, volume 2832 of LNCS, pages 434-445. Springer, 2003.
21. K. Munagala and A. Ranade. I/O-complexity of graph algorithms. In Proc. 10th Annual Symposium on Discrete Algorithms, pages 687-694. ACM-SIAM, 1999.
22. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, June 2001.