An improved parallel algorithm that computes the BFS numbering of a directed graph-Reference-Cited by-同舟云学术

An improved parallel algorithm that computes the BFS numbering of a directed graph

Author:

Gazit Hillel,Miller Gary L.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference5 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. Computer Algorithms: Introduction to Design and Analysis;Baase,1983

3. Matrix multiplication via arithmetic progressions;Coppersmith;Proc. 19th Ann. ACM Symp. on Theory of Computing,1987

4. How to Multiply Matrices Faster;Pan,1984

5. Gaussian elimination is not optimal;Strassen;Numerische Mathematik,1969

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

2. A fast parallel max-flow algorithm;Journal of Parallel and Distributed Computing;2022-11

4. A Parallel Algorithm of Path Planning for DEM Terrain Data;2018 17th International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES);2018-10

5. Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11