OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Finding strongly connected components of simple digraphs based on generalized rough sets theory
Taihua Xu, Guoyin Wang
Knowledge-Based Systems (2018) Vol. 149, pp. 88-98
Closed Access | Times Cited: 15
Taihua Xu, Guoyin Wang
Knowledge-Based Systems (2018) Vol. 149, pp. 88-98
Closed Access | Times Cited: 15
Showing 15 citing articles:
A map-reduce algorithm to find strongly connected components of directed graphs
Fujun Ji, Jidong Jin
Soft Computing (2025)
Open Access
Fujun Ji, Jidong Jin
Soft Computing (2025)
Open Access
Symmetry-based granulation in networks associated with commutative rings: application in social network dynamics
Imran Javaid, Abeer Fatima, Muhammad Akram
Journal of Applied Mathematics and Computing (2025)
Closed Access
Imran Javaid, Abeer Fatima, Muhammad Akram
Journal of Applied Mathematics and Computing (2025)
Closed Access
Uncertain knowledge graph embedding: an effective method combining multi-relation and multi-path
Qi Liu, Qinghua Zhang, Fan Zhao, et al.
Frontiers of Computer Science (2024) Vol. 18, Iss. 3
Closed Access | Times Cited: 4
Qi Liu, Qinghua Zhang, Fan Zhao, et al.
Frontiers of Computer Science (2024) Vol. 18, Iss. 3
Closed Access | Times Cited: 4
Hybrid harmony search algorithm for social network contact tracing of COVID-19
Ala’a Al-Shaikh, Basel A. Mahafzah, Mohammad Alshraideh
Soft Computing (2021) Vol. 27, Iss. 6, pp. 3343-3365
Open Access | Times Cited: 29
Ala’a Al-Shaikh, Basel A. Mahafzah, Mohammad Alshraideh
Soft Computing (2021) Vol. 27, Iss. 6, pp. 3343-3365
Open Access | Times Cited: 29
A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory
Mingfeng Hua, Taihua Xu, Xibei Yang, et al.
Mathematical Biosciences & Engineering (2024) Vol. 21, Iss. 2, pp. 2626-2645
Open Access | Times Cited: 2
Mingfeng Hua, Taihua Xu, Xibei Yang, et al.
Mathematical Biosciences & Engineering (2024) Vol. 21, Iss. 2, pp. 2626-2645
Open Access | Times Cited: 2
Finding strongly connected components of simple digraphs based on granulation strategy
Taihua Xu, Guoyin Wang, Jie Yang
International Journal of Approximate Reasoning (2019) Vol. 118, pp. 64-78
Open Access | Times Cited: 16
Taihua Xu, Guoyin Wang, Jie Yang
International Journal of Approximate Reasoning (2019) Vol. 118, pp. 64-78
Open Access | Times Cited: 16
A Granulation Strategy-Based Algorithm for Computing Strongly Connected Components in Parallel
Huixing He, Taihua Xu, Jianjun Chen, et al.
Mathematics (2024) Vol. 12, Iss. 11, pp. 1723-1723
Open Access | Times Cited: 1
Huixing He, Taihua Xu, Jianjun Chen, et al.
Mathematics (2024) Vol. 12, Iss. 11, pp. 1723-1723
Open Access | Times Cited: 1
Graph reduction in a path information-based rough directed graph model
Danyang Wang, Ping Zhu
Soft Computing (2022) Vol. 26, Iss. 9, pp. 4171-4186
Closed Access | Times Cited: 5
Danyang Wang, Ping Zhu
Soft Computing (2022) Vol. 26, Iss. 9, pp. 4171-4186
Closed Access | Times Cited: 5
Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances
Marta Fort, J. Antoni Sellarès, Nacho Valladares
Knowledge-Based Systems (2019) Vol. 192, pp. 105299-105299
Open Access | Times Cited: 7
Marta Fort, J. Antoni Sellarès, Nacho Valladares
Knowledge-Based Systems (2019) Vol. 192, pp. 105299-105299
Open Access | Times Cited: 7
Parallel Strong Connectivity Based on Faster Reachability
L. Wang, Xiaojun Dong, Yan Gu, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-29
Open Access | Times Cited: 2
L. Wang, Xiaojun Dong, Yan Gu, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-29
Open Access | Times Cited: 2
Finding single-source shortest paths from unweighted directed graphs combining rough sets theory and marking strategy
Taihua Xu, Mingfeng Hua, Xibei Yang, et al.
Journal of Applied Mathematics and Computing (2024)
Closed Access
Taihua Xu, Mingfeng Hua, Xibei Yang, et al.
Journal of Applied Mathematics and Computing (2024)
Closed Access
Efficient parallel algorithm for finding strongly connected components based on granulation strategy
Taihua Xu, Huixing He, Xibei Yang, et al.
Knowledge and Information Systems (2024)
Closed Access
Taihua Xu, Huixing He, Xibei Yang, et al.
Knowledge and Information Systems (2024)
Closed Access
Approximation operators via TD-matroids on two sets
Gang Wang, Hua Mao
Soft Computing (2022) Vol. 26, Iss. 19, pp. 9785-9804
Open Access | Times Cited: 1
Gang Wang, Hua Mao
Soft Computing (2022) Vol. 26, Iss. 19, pp. 9785-9804
Open Access | Times Cited: 1
Attribute reduction based on improving DIT in interval‐valued ordered information system
Lei Yang, Xiaoyan Zhang, Weihua Xu, et al.
The Journal of Engineering (2020) Vol. 2020, Iss. 13, pp. 429-437
Open Access
Lei Yang, Xiaoyan Zhang, Weihua Xu, et al.
The Journal of Engineering (2020) Vol. 2020, Iss. 13, pp. 429-437
Open Access
Granular computing on basic digraphs
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
Applicable Analysis and Discrete Mathematics (2022) Vol. 16, Iss. 1, pp. 23-54
Open Access
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
Applicable Analysis and Discrete Mathematics (2022) Vol. 16, Iss. 1, pp. 23-54
Open Access
