Affiliation:
1. School of Computer, Jiangsu University of Science and Technology, Zhenjiang 212100, China
Abstract
Granular computing (GrC) is a methodology for reducing the complexity of problem solving and includes two basic aspects: granulation and granular-based computing. Strongly connected components (SCCs) are a significant subgraph structure in digraphs. In this paper, two new granulation strategies were devised to improve the efficiency of computing SCCs. Firstly, four SCC correlations between the vertices were found, which can be divided into two classes. Secondly, two granulation strategies were designed based on correlations between two classes of SCCs. Thirdly, according to the characteristics of the granulation results, the parallelization of computing SCCs was realized. Finally, a parallel algorithm based on granulation strategy for computing SCCs of simple digraphs named GPSCC was proposed. Experimental results show that GPSCC performs with higher computational efficiency than algorithms.
Funder
National Natural Science Foundation of China
Reference41 articles.
1. Depth-first search and linear graph algorithms;Tarjan;SIAM J. Comput.,1972
2. Bernstein, A., Gutenberg, M., and Saranurak, T. (2020, January 16–19). Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing. Proceedings of the 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), Durham, NC, USA.
3. An efficient strongly connected components algorithm in the fault tolerant model;Baswana;Algorithmica,2019
4. Efficient semi-external SCC computation;Wan;IEEE Trans. Knowl. Data Eng.,2023
5. Decremental strongly connected components and single-source reachability in near-linear time;Bernstein;SIAM J. Comput.,2023
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献