Author:
Chong Ka Wong,Han Yijie,Igarashi Yoshihide,Lam Tak Wah
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. Sorting in clogn parallel steps;Ajtai;Combinatorica,1983
2. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time? Proceedings of the 1995 Symposium on Theory of Computing, 1995, pp. 427–436.
3. New connectivity and MSF algorithms for shuffle-exchange network and PRAM;Awerbuch;IEEE Trans. Comput.,1987
4. Efficient parallel algorithms for some graph problems;Chin;Comm. ACM,1982
5. K.W. Chong, Finding minimum spanning trees on the EREW PRAM, Proceedings of the 1996 International Computer Symposium (ICS’96), Taiwan, 1996, pp. 7–14.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Engineering Massively Parallel MST Algorithms;2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05
2. Discovering and balancing fundamental cycles in large signed graphs;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2021-11-13
3. Optimal Algorithms for Graphs and Images on a Shared Memory Mesh;2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2016-05
4. An I/O Efficient Algorithm for Minimum Spanning Trees;Combinatorial Optimization and Applications;2015
5. A Parallel 2-Approximation NC-Algorithm for Range Assignment Problem in Packet Radio Networks;Distributed Computing and Internet Technology;2013