External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs-Reference-Cited by-同舟云学术

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs

Published:2004 Issue: Volume: Page:146-157
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Arge Lars,Meyer Ulrich,Toma Laura

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-27836-8_15.pdf

Reference17 articles.

1. Aggarwal, A., Vitter, J.S.: The Input/Output complexity of sorting and related problems. Communications of the ACM 31(9), 1116–1127 (1988)

2. Lecture Notes in Computer Science;L. Arge,2000

3. Arge, L., Toma, L., Zeh, N.: I/O-efficient topological sorting of planar DAGs. In: Proc. ACM Symposium on Parallel Algorithms and Architectures (2003)

4. Buchsbaum, A.L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.R.: On external memory graph traversal. In: Proc. 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. SODA, pp. 139–149 (1995)

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

1. I/O-Optimal Cache-Oblivious Sparse Matrix-Sparse Matrix Multiplication;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05

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

3. I/O-efficient approximation of graph diameters by parallel cluster growing — a first experimental study;PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware;2012-10

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

5. I/O-efficient Hierarchical Diameter Approximation;Algorithms – ESA 2012;2012