{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T19:01:26Z","timestamp":1779217286230,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62006099"],"award-info":[{"award-number":["62006099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62076111"],"award-info":[{"award-number":["62076111"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10115-024-02299-w","type":"journal-article","created":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T03:18:03Z","timestamp":1735269483000},"page":"2855-2879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient parallel algorithm for finding strongly connected components based on granulation strategy"],"prefix":"10.1007","volume":"67","author":[{"given":"Taihua","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huixing","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xibei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"issue":"1","key":"2299_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ipl.2015.08.010","volume":"116","author":"D Pearce","year":"2016","unstructured":"Pearce D (2016) A space-efficient algorithm for finding strongly connected components. Inf Process Lett 116(1):47\u201352","journal-title":"Inf Process Lett"},{"issue":"2","key":"2299_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146\u2013160","journal-title":"SIAM J Comput"},{"issue":"1","key":"2299_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir M (1981) A strong-connectivity algorithm and its applications in data flow analysis. Comput Math Appl 7(1):67\u201372","journal-title":"Comput Math Appl"},{"key":"2299_CR4","doi-asserted-by":"crossref","unstructured":"Gabow H (2000) Path-based depth-first search for strong and biconnected components, Inf Process Lett","DOI":"10.1016\/S0020-0190(00)00051-X"},{"key":"2299_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ijar.2019.12.001","volume":"118","author":"T Xu","year":"2020","unstructured":"Xu T, Wang G, Yang J (2020) Finding strongly connected components of simple digraphs based on granulation strategy. Int J Approx Reason 118:64\u201378","journal-title":"Int J Approx Reason"},{"issue":"8","key":"2299_CR6","first-page":"97","volume":"49","author":"F Cheng","year":"2022","unstructured":"Cheng F, Xu T, Chen J, Song J, Yang X (2022) The algorithm for finding strongly connected components based on k-step search of vertex granule and rough set theory (in chinese). Comput Sci 49(8):97\u2013107","journal-title":"Comput Sci"},{"key":"2299_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.02.038","volume":"149","author":"T Xu","year":"2018","unstructured":"Xu T, Wang G (2018) Finding strongly connected components of simple digraphs based on generalized rough sets theory. Knowl-Based Syst 149:88\u201398","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2299_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10009-015-0382-1","volume":"18","author":"G Lowe","year":"2016","unstructured":"Lowe G (2016) Concurrent depth-first search algorithms based on Tarjan algorithm. Int J Softw Tools Technol Transfer 18(2):129\u2013147","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"2299_CR9","doi-asserted-by":"crossref","unstructured":"Bloemen V, Laarman A, van\u00a0de Pol J (2016) Multi-core on-the-fly SCC decomposition, in: Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming pp 1\u201312","DOI":"10.1145\/2851141.2851161"},{"issue":"1","key":"2299_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/logcom\/exp003","volume":"21","author":"J Barnat","year":"2011","unstructured":"Barnat J, Chaloupka J, Van De Pol J (2011) Distributed algorithms for SCC decomposition. J Log Comput 21(1):23\u201344","journal-title":"J Log Comput"},{"key":"2299_CR11","doi-asserted-by":"crossref","unstructured":"Evangelista S, Petrucci L, Youcef S (2011) Parallel nested depth-first searches for LTL model checking. In: International Symposium on Automated Technology for Verification and Analysis, Springer, pp 381\u2013396","DOI":"10.1007\/978-3-642-24372-1_27"},{"issue":"5","key":"2299_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341\u2013356","journal-title":"Int J Comput Inf Sci"},{"issue":"2","key":"2299_CR13","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.3934\/mbe.2024116","volume":"21","author":"M Hua","year":"2024","unstructured":"Hua M, Xu T, Yang X, Chen J, Yang J (2024) A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory. Math Biosci Eng 21(2):2626\u20132645","journal-title":"Math Biosci Eng"},{"key":"2299_CR14","doi-asserted-by":"publisher","first-page":"109024","DOI":"10.1016\/j.ijar.2023.109024","volume":"162","author":"J Yao","year":"2023","unstructured":"Yao J, Cornelis C, Wang G, Yao Y (2023) Uncertainty and three-way decision in data science. Int J Approx Reason 162:109024","journal-title":"Int J Approx Reason"},{"key":"2299_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ins.2014.02.070","volume":"271","author":"W Du","year":"2014","unstructured":"Du W, Hu B (2014) Approximate distribution reducts in inconsistent interval-valued ordered decision tables. Inf Sci 271:93\u2013114","journal-title":"Inf Sci"},{"key":"2299_CR16","doi-asserted-by":"publisher","first-page":"109928","DOI":"10.1016\/j.asoc.2022.109928","volume":"133","author":"Y Kang","year":"2023","unstructured":"Kang Y, Dai J (2023) Attribute reduction in inconsistent grey decision systems based on variable precision grey multigranulation rough set model. Appl Soft Comput 133:109928","journal-title":"Appl Soft Comput"},{"key":"2299_CR17","doi-asserted-by":"publisher","first-page":"101954","DOI":"10.1016\/j.inffus.2023.101954","volume":"100","author":"Q Zhang","year":"2023","unstructured":"Zhang Q, Yang Y, Cheng Y, Wang G, Ding W, Wu W, Pelusi D (2023) Information fusion for multi-scale data: survey and challenges. Inf Fusion 100:101954","journal-title":"Inf Fusion"},{"key":"2299_CR18","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.ijar.2018.11.010","volume":"105","author":"X Yang","year":"2019","unstructured":"Yang X, Liang S, Yu H, Gao S, Qian Y (2019) Pseudo-label neighborhood rough set: measures and attribute reductions. Int J Approx Reason 105:112\u2013129","journal-title":"Int J Approx Reason"},{"key":"2299_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.knosys.2018.11.034","volume":"165","author":"K Liu","year":"2019","unstructured":"Liu K, Yang X, Yu H, Mi J, Wang P, Chen X (2019) Rough set based semi-supervised feature selection via ensemble selector. Knowl-Based Syst 165:282\u2013296","journal-title":"Knowl-Based Syst"},{"key":"2299_CR20","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.neucom.2015.06.090","volume":"174","author":"X Luan","year":"2016","unstructured":"Luan X, Li Z, Liu T (2016) A novel attribute reduction algorithm based on rough set and improved artificial fish swarm algorithm. Neurocomputing 174:522\u2013529","journal-title":"Neurocomputing"},{"key":"2299_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ijar.2022.09.007","volume":"151","author":"C Gao","year":"2022","unstructured":"Gao C, Zhou J, Xing J, Yue X (2022) Parameterized maximum-entropy-based three-way approximate attribute reduction. Int J Approx Reason 151:85\u2013100","journal-title":"Int J Approx Reason"},{"key":"2299_CR22","doi-asserted-by":"publisher","first-page":"121062","DOI":"10.1016\/j.eswa.2023.121062","volume":"234","author":"H Mao","year":"2023","unstructured":"Mao H, Wang S, Liu C, Wang G (2023) Hypergraph-based attribute reduction of formal contexts in rough sets. Expert Syst Appl 234:121062","journal-title":"Expert Syst Appl"},{"issue":"8","key":"2299_CR23","doi-asserted-by":"publisher","first-page":"4376","DOI":"10.1109\/TFUZZ.2024.3397697","volume":"32","author":"J Yang","year":"2024","unstructured":"Yang J, Liu Z, Xia S, Wang G, Zhang Q, Li S, Xu T (2024) 3WC-GBNRS++: a novel three-way classifier with granular-ball neighborhood rough sets based on uncertainty. IEEE Trans Fuzzy Syst 32(8):4376\u20134387","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"24","key":"2299_CR24","doi-asserted-by":"publisher","first-page":"29781","DOI":"10.1007\/s10489-023-05123-0","volume":"53","author":"S Zhang","year":"2023","unstructured":"Zhang S, Liu K, Xu T, Yang X, Zhang A (2023) A meta-heuristic feature selection algorithm combining random sampling accelerator and ensemble using data perturbation. Appl Intell 53(24):29781\u201329798","journal-title":"Appl Intell"},{"key":"2299_CR25","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.ijar.2021.06.005","volume":"136","author":"A Campagner","year":"2021","unstructured":"Campagner A, Ciucci D, Hllermeier E (2021) Rough set-based feature selection for weakly labeled data. Int J Approx Reason 136:150\u2013167","journal-title":"Int J Approx Reason"},{"issue":"1","key":"2299_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0255(02)00197-4","volume":"147","author":"Z Pawlak","year":"2002","unstructured":"Pawlak Z (2002) Rough sets and intelligent data analysis. Inf Sci 147(1):1\u201312","journal-title":"Inf Sci"},{"issue":"5","key":"2299_CR27","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1109\/TFUZZ.2019.2955047","volume":"28","author":"H Fujita","year":"2020","unstructured":"Fujita H, Gaeta A, Loia V, Orciuoli F (2020) Hypotheses analysis and assessment in counterterrorism activities: a method based on OWA and fuzzy probabilistic rough sets. IEEE Trans Fuzzy Syst 28(5):831\u2013845","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2299_CR28","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.ins.2019.01.033","volume":"507","author":"C Zhang","year":"2020","unstructured":"Zhang C, Li D, Liang J (2020) Multi-granularity three-way decisions with adjustable hesitant fuzzy linguistic multigranulation decision-theoretic rough sets over two universes. Inf Sci 507:665\u2013683","journal-title":"Inf Sci"},{"key":"2299_CR29","doi-asserted-by":"publisher","first-page":"101942","DOI":"10.1016\/j.jocs.2023.101942","volume":"67","author":"R Guha","year":"2023","unstructured":"Guha R, Ghosh K, Bera S, Sarkar R, Mirjalili S (2023) Discrete equilibrium optimizer combined with simulated annealing for feature selection. J Comput Sci 67:101942","journal-title":"J Comput Sci"},{"key":"2299_CR30","doi-asserted-by":"crossref","unstructured":"Ab dElaziz M, Ouadfel S, AbdEl-Latif A, Ibrahim R (2022) Feature selection based on modified bio-inspired atomic orbital search using arithmetic optimization and opposite-based learning. Cogn Comput 14(6):2274\u20132295","DOI":"10.1007\/s12559-022-10022-6"},{"key":"2299_CR31","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.ins.2013.12.043","volume":"281","author":"Y Zhang","year":"2014","unstructured":"Zhang Y, Mao Z, Li J, Tian Q (2014) Salient region detection for complex background images using integrated features. Inf Sci 281:586\u2013600","journal-title":"Inf Sci"},{"key":"2299_CR32","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1109\/TFUZZ.2020.3001670","volume":"29","author":"K Zhang","year":"2020","unstructured":"Zhang K, Zhan J, Wu WZ (2020) On multicriteria decision-making method based on a fuzzy rough set model with fuzzy a-neighborhoods. IEEE Trans Fuzzy Syst 29:2491\u20132505","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"1","key":"2299_CR33","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0020-0255(98)10006-3","volume":"111","author":"Y Yao","year":"1998","unstructured":"Yao Y (1998) Relational interpretations of neighborhood operators and rough set approximation operators. Inf Sci 111(1):239\u2013259","journal-title":"Inf Sci"},{"key":"2299_CR34","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4018\/IJISP.2020070106","volume":"14","author":"R Penmatsa","year":"2020","unstructured":"Penmatsa R, Kalidindi A, Mallidi S (2020) Feature reduction and optimization of malware detection system using ant colony optimization and rough sets. Int J Inf Secur Priv 14:95\u2013114","journal-title":"Int J Inf Secur Priv"},{"key":"2299_CR35","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.ijar.2018.11.010","volume":"105","author":"X Yang","year":"2019","unstructured":"Yang X, Liang S, Yu H, Gao S, Qian Y (2019) Pseudo-label neighborhood rough set: measures and attribute reductions. Int J Approx Reason 105:112\u2013129","journal-title":"Int J Approx Reason"},{"key":"2299_CR36","doi-asserted-by":"crossref","unstructured":"Yang L, Qin K, Sang B, Xu W (2021) Dynamic fuzzy neighborhood rough set approach for interval-valued information systems with fuzzy decision. Appl Soft Comput 111(C)","DOI":"10.1016\/j.asoc.2021.107679"},{"issue":"6","key":"2299_CR37","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1109\/TSMCC.2012.2236648","volume":"43","author":"J Yao","year":"2013","unstructured":"Yao J, Vasilakos A, Pedrycz W (2013) Granular computing: perspectives and challenges. IEEE Trans Cybern 43(6):1977\u20131989","journal-title":"IEEE Trans Cybern"},{"key":"2299_CR38","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ijar.2018.09.005","volume":"103","author":"Y Yao","year":"2018","unstructured":"Yao Y (2018) Three-way decision and granular computing. Int J Approx Reason 103:107\u2013123","journal-title":"Int J Approx Reason"},{"issue":"1","key":"2299_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s41066-019-00204-3","volume":"6","author":"Y Cheng","year":"2021","unstructured":"Cheng Y, Zhao F, Zhang Q, Wang G (2021) A survey on granular computing and its uncertainty measure from the perspective of rough set theory. Granular Comput 6(1):3\u201317","journal-title":"Granular Comput"},{"issue":"9","key":"2299_CR40","doi-asserted-by":"publisher","first-page":"9319","DOI":"10.1109\/TKDE.2023.3237833","volume":"35","author":"Q Zhang","year":"2023","unstructured":"Zhang Q, Wu C, Xia S, Zhao F, Gao M, Cheng Y, Wang G (2023) Incremental learning based on granular ball rough sets for classification in dynamic mixed-type decision system. IEEE Trans Knowl Data Eng 35(9):9319\u20139332","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2299_CR41","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1109\/TCYB.2020.2964011","volume":"52","author":"Z Han","year":"2022","unstructured":"Han Z, Pedrycz W, Zhao J, Wang W (2022) Hierarchical granular computing-based model and its reinforcement structural learning for construction of long-term prediction intervals. IEEE Trans Cybern 52(1):666\u2013676","journal-title":"IEEE Trans Cybern"},{"key":"2299_CR42","doi-asserted-by":"crossref","unstructured":"Cheng D, Li Y, Xia S, Wang G, Huang J, Zhang S (2023) A fast granular-ball-based density peaks clustering algorithm for large-scale data. IEEE Trans Neural Netw Learn Syst 1\u201314","DOI":"10.2139\/ssrn.4503454"},{"key":"2299_CR43","doi-asserted-by":"crossref","unstructured":"Bang-Jensen J, Gutin G (2008) Digraphs: theory, algorithms and applications, Springer Science & Business Media","DOI":"10.1007\/978-1-84800-998-1"},{"key":"2299_CR44","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.knosys.2012.07.013","volume":"37","author":"Jinkun Chen","year":"2013","unstructured":"Chen Jinkun, Li Jinjin, Lin Yaojin (2013) Computing connected components of simple undirected graphs based on generalized rough sets. Knowl-Based Syst 37:80\u201385. https:\/\/doi.org\/10.1016\/j.knosys.2012.07.013","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"2299_CR45","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0888-613X(96)00071-0","volume":"15","author":"Y.Y. Yao","year":"1996","unstructured":"Yao Y.Y. (1996) Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning 15(4):291\u2013317. https:\/\/doi.org\/10.1016\/S0888-613X(96)00071-0","journal-title":"International Journal of Approximate Reasoning"},{"issue":"1","key":"2299_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"Timothy A. Davis","year":"2011","unstructured":"Davis Timothy A., Hu Yifan (2011) The university of Florida sparse matrix collection. ACM Trans Math Softw 38(1):1\u201325. https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans Math Softw"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02299-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02299-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02299-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:04:11Z","timestamp":1739405051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02299-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2299"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02299-w","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"15 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}