I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths-Reference-Cited by-同舟云学术

I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths

Published:2006 Issue: Volume: Page:540-551
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Meyer Ulrich,Zeh Norbert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11841036_49.pdf

Reference13 articles.

1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Comm. ACM, 1116–1127 (1988)

2. Arge, L., Brodal, G.S., Toma, L.: On external-memory MST, SSSP and multi-way planar graph separation. J. Alg. 53(2), 186–206 (2004)

3. Arge, L., Toma, L., Zeh, N.: I/O-efficient algorithms for planar digraphs. In: Proc. 15th SPAA, pp. 85–93 (2003)

4. Buchsbaum, A.L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.R.: On external memory graph traversal. In: Proc. 11th SODA, pp. 859–860 (2000)

5. Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. 6th SODA, pp. 139–149 (1995)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. I/O-Efficient Algorithms for Topological Sort and Related Problems;ACM Transactions on Algorithms;2022-01-23

2. Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs;ACM Transactions on Algorithms;2018-01-30

3. DecreaseKeys are expensive for external memory priority queues;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19

4. I/O efficient: computing SCCs in massive graphs;The VLDB Journal;2014-09-24

5. I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths;ACM Transactions on Algorithms;2012-07