A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix

[1]  Theresa Beaubouef,et al.  Rough Sets , 2019, Lecture Notes in Computer Science.

[2]  Ismail Karaoglan,et al.  The Multi-Vehicle Probabilistic Covering Tour Problem , 2018, Eur. J. Oper. Res..

[3]  Chunqiang Yu,et al.  Test-cost-sensitive rough set based approach for minimum weight vertex cover problem , 2018, Appl. Soft Comput..

[4]  Yaojin Lin,et al.  A rough set method for the unicost set covering problem , 2015, International Journal of Machine Learning and Cybernetics.

[5]  Xizhao Wang,et al.  Comparison of reduction in formal decision contexts , 2017, Int. J. Approx. Reason..

[6]  Yaojin Lin,et al.  A rough set method for the minimum vertex cover problem of graphs , 2016, Appl. Soft Comput..

[7]  L. Jinjin,et al.  A rough set method for the vertex cover problem in graph theory , 2016 .

[8]  Jinjin Li,et al.  A rough set method for the vertex cover problem in graph theory , 2016, J. Intell. Fuzzy Syst..

[9]  林耀进,et al.  The relationship between attribute reducts in rough sets and minimal vertex covers of graphs , 2015 .

[10]  Wenhao Shu,et al.  A fast approach to attribute reduction from perspective of attribute measures in incomplete decision systems , 2014, Knowl. Based Syst..

[11]  Henry P. Wynn,et al.  Measuring the robustness of a network using minimal vertex covers , 2014, Math. Comput. Simul..

[12]  Degang Chen,et al.  Attribute Reduction for Heterogeneous Data Based on the Combination of Classical and Fuzzy Rough Set Models , 2014, IEEE Transactions on Fuzzy Systems.

[13]  Qinghua Hu,et al.  A novel method for attribute reduction of covering decision systems , 2014, Inf. Sci..

[14]  Cun-Quan Zhang,et al.  Circuit extension and circuit double cover of graphs , 2013, Discret. Math..

[15]  Jinhai Li,et al.  Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction , 2013, Int. J. Approx. Reason..

[16]  Lei Zhang,et al.  Sample Pair Selection for Attribute Reduction with Rough Set , 2012, IEEE Transactions on Knowledge and Data Engineering.

[17]  Zhenhua Cui,et al.  Combination of parallel machine scheduling and vertex cover , 2012, Theor. Comput. Sci..

[18]  Jinkun Chen,et al.  An application of rough sets to graph theory , 2012, Inf. Sci..

[19]  S. Listrovoy,et al.  The solution algorithms for problems on the minimal vertex cover in networks and the minimal cover in Boolean matrixes , 2012 .

[20]  Qinghua Hu,et al.  Neighborhood rough set based heterogeneous feature subset selection , 2008, Inf. Sci..

[21]  Chen Degang,et al.  A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets , 2007 .

[22]  Primoz Potocnik,et al.  Mobility of vertex-transitive graphs , 2007, Discret. Math..

[23]  Panos M. Pardalos,et al.  Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems , 2006, Comput. Oper. Res..

[24]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[25]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[26]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[27]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[28]  Frank Harary,et al.  Graph Theory , 2016 .