Cache-oblivious planar shortest paths

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 563-575

  Jampala, Hema ^a   Zeh, Norbert ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; GRAPH THEORY; PROBLEM SOLVING;

PLANAR GRAPHS; SHORTEST-PATH ALGORITHM; VERTICES;

ALGORITHMS;

EID: 26444438097     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_46     Document Type: Conference Paper

References (23)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Comm. ACM, pp. 1116-1127, 1988.
2. L. Arge, M. A. Bender, E. Demaine, B. Holland-Minkley, and J. I. Munro. Cacheoblivious priority queue and graph algorithm applications. Proc. 34th STOC, pp. 268-276, 2002.
3. L. Arge, G. S. Brodal, and L. Toma. On external-memory MST, SSSP and multiway planar graph separation. J. Alg., 53:186-206, 2004.
4. L. Arge, U. Meyer, and L. Toma. External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs. Proc. 31st ICALP, LNCS 3142, pp. 146-157. Springer-Verlag, 2004.
5. L. Arge, U. Meyer, L. Toma, and N. Zeh. On external-memory planar depth first search. J. Graph Alg. and Appl., 7(2):105-129, 2003.
6. L. Arge and L. Toma. Simplified external memory algorithms for planar DAGs. Proc. 9th SWAT, LNCS 3111, pp. 493-503. Springer-Verlag, 2004.
7. L. Arge, L. Toma, and N. Zeh. I/O-efficient algorithms for planar digraphs. Proc. 15th SPAA, pp. 85-93. 2003.
8. L. Arge and N. Zeh. I/O-efficient strong connectivity and depth-first search for directed planar graphs. Proc. 44th FOCS, pp. 261-270, 2003.
9. G. S. Brodai and R. Fagerberg. Cache oblivious distribution sweeping. Proc. 29th ICALP, LNCS 2380, pp. 426-438. Springer-Verlag, 2002.
10. G. S. Brodai and R. Fagerberg. Funnel heap - a cache oblivious priority queue. Proc. 13th ISAAC, LNCS 2518, pp. 219-228. Springer-Verlag, 2002.
11. G. S. Brodai and R. Fagerberg. On the limits of cache-obliviousness. Proc. 35th STOC, pp. 307-315, 2003.
12. G. S. Brodal, R. Fagerberg, U. Meyer, and N. Zeh. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. Proc. 9th SWAT, LNCS 3111, pp. 480-492. Springer-Ver lag, 2004.
13. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. Proc. 6th SODA, pp. 139-149, 1995.
14. R. A. Chowdhury and V. Ramachandran. Cache-oblivious shortest paths in graphs using buffer heap. Proc. 16th SPAA, pp. 245-254, 2004.
15. E. W. Dijkstra. A note on two problems in connection with graphs. Num. Math., 1:269-271, 1959.
16. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, near linear time. Proc. 42nd FOCS, pp. 232-241, 2001.
17. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comp., 16:1004-1022, 1987.
18. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. Proc. 40th FOGS, pp. 285-297, 1999.
19. P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest path algorithms for planar graphs. J. Comp. Sys. Sci., 55:3-23, 1997.
20. A. Maheshwari and N. Zeh. I/O-optimal algorithms for planar graphs using separators. Proc. 13th SODA, pp. 372-381, 2002.
21. S. Pettie and V. Ramachandran. Computing shortest paths with comparisons and additions. Proc. 13th SODA, pp. 267-276, 2002.
22. M. Thorup. Undirected single source shortest paths with positive integer weights in linear time. J. ACM, 46:362-394, 1999.
23. M. Thorup. Floats, integers, and single source shortest paths. J. Alg., 35:189-201, 2000.