{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T23:38:49Z","timestamp":1780789129173,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T00:00:00Z","timestamp":1441584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00500-015-1859-2","type":"journal-article","created":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T06:41:59Z","timestamp":1441608119000},"page":"1841-1851","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Connectedness of graphs and its application to connected matroids through covering-based rough sets"],"prefix":"10.1007","volume":"20","author":[{"given":"Aiping","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,7]]},"reference":[{"key":"1859_CR1","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1016\/j.disc.2010.12.015","volume":"311","author":"H Bruhn","year":"2011","unstructured":"Bruhn H, Diestel R (2011) Infinite matroids in graphs. Discrete Math 311:1461\u20131471","journal-title":"Discrete Math"},{"key":"1859_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4070-7","volume-title":"Introduction to discrete event systems","author":"CG Cassandras","year":"1999","unstructured":"Cassandras CG, Laforttune S (1999) Introduction to discrete event systems. Kluwer, Boston, MA"},{"key":"1859_CR3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.knosys.2012.07.013","volume":"37","author":"J Chen","year":"2013","unstructured":"Chen J, Li J, Lin Y (2013) Computing connected components of simple undirected graphs based on generalized rough sets. Knowl-Based Syst 37:80\u201385","journal-title":"Knowl-Based Syst"},{"key":"1859_CR4","doi-asserted-by":"crossref","first-page":"12249","DOI":"10.1016\/j.eswa.2011.04.003","volume":"38","author":"Y Cheng","year":"2011","unstructured":"Cheng Y, Miao D (2011) Rule extraction based on granulation order in interval-valued fuzzy infromation system. Expert Syst Appl 38:12249\u201312261","journal-title":"Expert Syst Appl"},{"key":"1859_CR5","doi-asserted-by":"crossref","unstructured":"Chen J, Ratnesh K (2014) Pattern mining for predicting critical events from sequential event data log. In: 2014 IFAC\/IEEE International Workshop on Discrete Event Systems Paris-Cachan, 14\u201316 May 2014","DOI":"10.3182\/20140514-3-FR-4046.00120"},{"key":"1859_CR6","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1109\/TASE.2013.2251334","volume":"10","author":"J Chen","year":"2013","unstructured":"Chen J, Ratnesh K (2013) Polynomial test for stochastic diagnosability of discrete event systems. IEEE Trans Autom Sci Eng 10:969\u2013979","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1859_CR7","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TAC.2014.2381437","volume":"60","author":"J Chen","year":"2015","unstructured":"Chen J, Ratnesh K (2015) Stochastic failure prognosability of discrete event systems. IEEE Trans Autom Control 60:1570\u20131581","journal-title":"IEEE Trans Autom Control"},{"key":"1859_CR8","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1016\/j.dam.2011.06.024","volume":"159","author":"M Chudnovsky","year":"2011","unstructured":"Chudnovsky M, Ries B, Zwols Y (2011) Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs. Discrete Appl Math 159:1971\u20131995","journal-title":"Discrete Appl Math"},{"key":"1859_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds J (1971) Matroids and the greedy algorithm. Math Progr 1:127\u2013136","journal-title":"Math Progr"},{"key":"1859_CR10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.dam.2013.09.013","volume":"162","author":"T Fukami","year":"2014","unstructured":"Fukami T, Takahashi N (2014) New classes of clustering coefficient locally maximizing graphs. Discrete Appl Math 162:202\u2013213","journal-title":"Discrete Appl Math"},{"key":"1859_CR11","doi-asserted-by":"crossref","unstructured":"Gossen T, Kotzyba M, N\u00fcrnberger A (2014) Graph clusterings with overlaps: adapted quality indices and a generation model. Neurocomputing 123:13\u201322","DOI":"10.1016\/j.neucom.2012.09.046"},{"key":"1859_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.ins.2013.11.014","volume":"263","author":"A Huang","year":"2014","unstructured":"Huang A, Zhao H, Zhu W (2014) Nullity-based matroid of rough sets and its application to attribute reduction. Inf Sci 263:153\u2013165","journal-title":"Inf Sci"},{"key":"1859_CR13","doi-asserted-by":"crossref","unstructured":"Huang A, Zhu W (2012) Geometric lattice structure of covering-based rough sets through matroids. J Appl Math Article ID 236307, p 25","DOI":"10.1155\/2012\/236307"},{"key":"1859_CR14","doi-asserted-by":"crossref","unstructured":"Huang A, Zhu W (2014) Geometric lattice structure of covering and its application to attribute reduction through matroids. J Appl Math Article ID 183621, p 8","DOI":"10.1155\/2014\/183621"},{"key":"1859_CR15","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.ins.2013.07.019","volume":"250","author":"G Liu","year":"2013","unstructured":"Liu G (2013) The relationship among different covering approximations. Inf Sci 250:178\u2013183","journal-title":"Inf Sci"},{"key":"1859_CR16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","volume":"16","author":"L Livi","year":"2013","unstructured":"Livi L, Rizzi A (2013) The graph matching problem. Pattern Anal Appl 16:253\u2013283. doi: 10.1007\/s10044-012-0284-8","journal-title":"Pattern Anal Appl"},{"key":"1859_CR17","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.ins.2012.04.031","volume":"211","author":"F Min","year":"2012","unstructured":"Min F, Zhu W (2012) Attribute reduction of data with error ranges and test costs. Inf Sci 211:48\u201367","journal-title":"Inf Sci"},{"key":"1859_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cosrev.2012.12.001","volume":"7","author":"DF Nettleton","year":"2013","unstructured":"Nettleton DF (2013) Data mining of social networks represented as graphs. Comput Sci Rev 7:1\u201334","journal-title":"Comput Sci Rev"},{"key":"1859_CR19","volume-title":"Matroid theory","author":"JG Oxley","year":"1993","unstructured":"Oxley JG (1993) Matroid theory. Oxford University Press, New York"},{"key":"1859_CR20","doi-asserted-by":"crossref","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:341\u2013356","journal-title":"Int J Comput Inf Sci"},{"key":"1859_CR21","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1016\/j.patcog.2012.09.015","volume":"46","author":"B Peng","year":"2013","unstructured":"Peng B, Zhang L, Zhang D (2013) A survey of graph theoretical approaches to image segmentation. Pattern Recogn 46:1020\u20131038","journal-title":"Pattern Recogn"},{"key":"1859_CR22","unstructured":"Pomykala JA (1987) Approximation operations in approximation space. Bull Polish Acad Sci 35:653\u2013662"},{"key":"1859_CR23","doi-asserted-by":"crossref","unstructured":"Shelokar P, Shelokar A, Cord\u00f3n W (2013) A multiobjective evolutionary programming framework for graph-based data mining. Inf Sci 237:118\u2013136","DOI":"10.1016\/j.ins.2013.02.014"},{"key":"1859_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2012\/973920","volume":"2012","author":"J Tang","year":"2012","unstructured":"Tang J, She K, Zhu W (2012) Matroidal structure of rough sets from the viewpoint of graph theory. J Appl Math 2012:1\u201327","journal-title":"J Appl Math"},{"key":"1859_CR25","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.ins.2012.07.030","volume":"220","author":"S Wang","year":"2013","unstructured":"Wang S, Zhu Q, Zhu W, Min F (2013) Quantitative analysis for covering-based rough sets through the upper approximation number. Inf Sci 220:483\u2013491","journal-title":"Inf Sci"},{"key":"1859_CR26","doi-asserted-by":"crossref","unstructured":"Wang S, Zhu Q, Zhu W, Min F (2013) Equivalent characterizations of some graph problems by covering-based rough sets. J Appl Math Article ID 519173, p 7","DOI":"10.1155\/2013\/519173"},{"key":"1859_CR27","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1016\/j.ijar.2013.07.001","volume":"54","author":"S Wang","year":"2013","unstructured":"Wang S, Zhu Q, Zhu W, Min F (2013) Four matroidal structures of covering and their relationships with rough sets. Int J Approx Reason 54:1361\u20131372","journal-title":"Int J Approx Reason"},{"key":"1859_CR28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.ins.2013.08.057","volume":"256","author":"C Wang","year":"2014","unstructured":"Wang C, He Q, Chen D, Hu Q (2014) A novel method for attribute reduction of covering decision systems. Inf Sci 256:181\u2013196","journal-title":"Inf Sci"},{"key":"1859_CR29","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ins.2013.10.018","volume":"263","author":"S Wang","year":"2014","unstructured":"Wang S, Zhu Q, Zhu W, Min F (2014) Characteristic matrix of covering and its application to Boolean matrix decomposition. Inf Sci 263:186\u2013197","journal-title":"Inf Sci"},{"key":"1859_CR30","volume-title":"Introduction to graph theory","author":"DB West","year":"2004","unstructured":"West DB (2004) Introduction to graph theory. China Machine Press, Beijing"},{"key":"1859_CR31","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.11.005","volume":"228","author":"T Yang","year":"2013","unstructured":"Yang T, Li Q, Zhou B (2013) Related family: a new method for attribute reduction of covering information systems. Inf Sci 228:175\u2013191","journal-title":"Inf Sci"},{"key":"1859_CR32","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1016\/j.ins.2011.01.013","volume":"181","author":"Z Yun","year":"2011","unstructured":"Yun Z, Ge X, Bai X (2011) Axiomatization and conditions for neighborhoods in a covering to form a partition. Inf Sci 181:1735\u20131740","journal-title":"Inf Sci"},{"key":"1859_CR33","first-page":"761","volume":"16","author":"W \u017bakowski","year":"1983","unstructured":"\u017bakowski W (1983) Approximations in the space $$(u, \\pi )$$ ( u , \u03c0 ) . Demonstr Math 16:761\u2013769","journal-title":"Demonstr Math"},{"key":"1859_CR34","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.ins.2009.08.031","volume":"180","author":"Y Zhang","year":"2010","unstructured":"Zhang Y, Li J, Wu W (2010) On axiomatic characterizations of three pairs of covering based approximation operators. Inf Sci 180:274\u2013287","journal-title":"Inf Sci"},{"key":"1859_CR35","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.patcog.2012.12.005","volume":"46","author":"H Zhou","year":"2013","unstructured":"Zhou H, Zheng J, Wei L (2013) Texture aware image segmentation using graph cuts and active contours. Pattern Recogn 46:1719\u20131733","journal-title":"Pattern Recogn"},{"key":"1859_CR36","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1016\/j.ins.2009.02.013","volume":"179","author":"W Zhu","year":"2009","unstructured":"Zhu W (2009) Relationship among basic concepts in covering-based rough sets. Inf Sci 179:2478\u20132486","journal-title":"Inf Sci"},{"key":"1859_CR37","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.ins.2008.09.015","volume":"179","author":"W Zhu","year":"2009","unstructured":"Zhu W (2009) Relationship between generalized rough sets based on binary relation and covering. Inf Sci 179:210\u2013225","journal-title":"Inf Sci"},{"key":"1859_CR38","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.ijar.2010.10.005","volume":"52","author":"P Zhu","year":"2011","unstructured":"Zhu P (2011) Covering rough sets based on neighborhoods: an approach without using neighborhoods. Int J Approx Reason 52:461\u2013472","journal-title":"Int J Approx Reason"},{"key":"1859_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2012.12.003","volume":"42","author":"P Zhu","year":"2013","unstructured":"Zhu P, Hu Q (2013) Rule extraction from support vector machines based on consistent region covering reduction. Knowl-Based Syst 42:1\u20138","journal-title":"Knowl-Based Syst"},{"key":"1859_CR40","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0020-0255(03)00056-2","volume":"152","author":"W Zhu","year":"2003","unstructured":"Zhu W, Wang F (2003) Reduction and axiomization of covering generalized rough sets. Inf Sci 152:217\u2013230","journal-title":"Inf Sci"},{"key":"1859_CR41","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.ins.2012.01.026","volume":"201","author":"W Zhu","year":"2009","unstructured":"Zhu W, Wang F (2009) The fourth type of covering-based rough sets. Inf Sci 201:80\u201392","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1859-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1859-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1859-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:51Z","timestamp":1559094231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1859-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,7]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1859"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1859-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,7]]}}}