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:
Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
Shiping Wang, Qingxin Zhu, William Zhu, et al.
Journal of Applied Mathematics (2013) Vol. 2013, pp. 1-7
Open Access | Times Cited: 15
Shiping Wang, Qingxin Zhu, William Zhu, et al.
Journal of Applied Mathematics (2013) Vol. 2013, pp. 1-7
Open Access | Times Cited: 15
Showing 15 citing articles:
Rough neighborhood graph: A method for proximity modeling and data clustering
Tomasz Hachaj, Jarosław Wąs
Applied Soft Computing (2025), pp. 112789-112789
Closed Access | Times Cited: 1
Tomasz Hachaj, Jarosław Wąs
Applied Soft Computing (2025), pp. 112789-112789
Closed Access | Times Cited: 1
Simple graphs in granular computing
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile
Information Sciences (2016) Vol. 340-341, pp. 279-304
Open Access | Times Cited: 49
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile
Information Sciences (2016) Vol. 340-341, pp. 279-304
Open Access | Times Cited: 49
Attribute reduction of covering decision systems by hypergraph model
Jinkun Chen, Yaojin Lin, Guoping Lin, et al.
Knowledge-Based Systems (2016) Vol. 118, pp. 93-104
Closed Access | Times Cited: 27
Jinkun Chen, Yaojin Lin, Guoping Lin, et al.
Knowledge-Based Systems (2016) Vol. 118, pp. 93-104
Closed Access | Times Cited: 27
A rough set method for the minimum vertex cover problem of graphs
Jinkun Chen, Yaojin Lin, Jinjin Li, et al.
Applied Soft Computing (2016) Vol. 42, pp. 360-367
Closed Access | Times Cited: 25
Jinkun Chen, Yaojin Lin, Jinjin Li, et al.
Applied Soft Computing (2016) Vol. 42, pp. 360-367
Closed Access | Times Cited: 25
Test-cost-sensitive rough set based approach for minimum weight vertex cover problem
Xiaojun Xie, Xiaolin Qin, Chunqiang Yu, et al.
Applied Soft Computing (2017) Vol. 64, pp. 423-435
Closed Access | Times Cited: 24
Xiaojun Xie, Xiaolin Qin, Chunqiang Yu, et al.
Applied Soft Computing (2017) Vol. 64, pp. 423-435
Closed Access | Times Cited: 24
Rough Set Theory Applied to Simple Undirected Graphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Lecture notes in computer science (2015), pp. 423-434
Open Access | Times Cited: 17
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Lecture notes in computer science (2015), pp. 423-434
Open Access | Times Cited: 17
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
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
Connectedness of graphs and its application to connected matroids through covering-based rough sets
Aiping Huang, William Zhu
Soft Computing (2015) Vol. 20, Iss. 5, pp. 1841-1851
Open Access | Times Cited: 9
Aiping Huang, William Zhu
Soft Computing (2015) Vol. 20, Iss. 5, pp. 1841-1851
Open Access | Times Cited: 9
Connectedness of Graph and Matroid by Covering-Based Rough Sets
Hui Li, William Zhu
Lecture notes in computer science (2015), pp. 149-160
Open Access | Times Cited: 3
Hui Li, William Zhu
Lecture notes in computer science (2015), pp. 149-160
Open Access | Times Cited: 3
Rough matroids based on coverings
Bin Yang, Hong Zhao, William Zhu
arXiv (Cornell University) (2013)
Open Access | Times Cited: 2
Bin Yang, Hong Zhao, William Zhu
arXiv (Cornell University) (2013)
Open Access | Times Cited: 2
Dependence space of matroids and its application to attribute reduction
Aiping Huang, William Zhu
arXiv (Cornell University) (2013)
Open Access | Times Cited: 1
Aiping Huang, William Zhu
arXiv (Cornell University) (2013)
Open Access | Times Cited: 1
Rough sets in graphs using similarity relations
Imran Javaid, Shahroz Ali, Shahid ur Rehman, et al.
AIMS Mathematics (2022) Vol. 7, Iss. 4, pp. 5790-5807
Open Access | Times Cited: 1
Imran Javaid, Shahroz Ali, Shahid ur Rehman, et al.
AIMS Mathematics (2022) Vol. 7, Iss. 4, pp. 5790-5807
Open Access | Times Cited: 1
Connectedness of graphs and its application to connected matroids through covering-based rough sets
Aiping Huang, William Zhu
arXiv (Cornell University) (2013)
Open Access
Aiping Huang, William Zhu
arXiv (Cornell University) (2013)
Open Access
Rough Sets in Graphs Using Similarity Relations.
Imran Javaid, Shahroz Ali, Shahid ur Rehman, et al.
arXiv (Cornell University) (2021)
Closed Access
Imran Javaid, Shahroz Ali, Shahid ur Rehman, et al.
arXiv (Cornell University) (2021)
Closed Access
