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

被引：2

作者：

Zhuang, Shengyang ^{[1
]}

Chen, Degang ^{[1
]}

机构：

[1] North China Elect Power Univ, Sch Math & Phys, Beijing 102206, Peoples R China

来源：

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS | 2019年 / 10卷 / 12期

关键词：

Vertex cover; Attribute reduction; Discernibility matrix; Minimal element; ROUGH SET METHOD; ATTRIBUTE REDUCTION; APPROXIMATION ALGORITHMS; COMBINATION;

D O I：

10.1007/s13042-019-00933-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Minimal vertex cover problem (MVCP) is a famous important NP-hard problem in graph theory. It has been reported that MVCP is equivalent to finding reducts of information systems in rough sets theory. This relationship motivates our idea to deal with MVCP in terms of approaches to discernibility matrix in rough set. First we point out that only minimal elements in the discernibility matrix are useful for MVCP, and we present a novel algorithm based on minimal elements for MVCP. Then we make experimental comparisons to demonstrate the effectiveness of this new algorithm on big graphs.

引用

页码：3467 / 3474

页数：8

共 50 条

[41] Increment algorithm for attribute reduction based on improvement of discernibility matrix
Feng, Shao-Rong
Zhang, Dong-Zhan
[J]. Feng, S.-R. (shaorong@xmu.edu.cn), 1600, Editorial Office of Journal of Shenzhen University (29): : 405 - 411
[42] Fast algorithms of attribute reduction for covering decision systems with minimal elements in discernibility matrix
Ze Dong
Ming Sun
Yanyan Yang
[J]. International Journal of Machine Learning and Cybernetics, 2016, 7 : 297 - 310
[43] AN APPROXIMATE ALGORITHM FOR THE MINIMAL VERTEX NESTED POLYGON PROBLEM
DASGUPTA, B
MADHAVAN, CEV
[J]. INFORMATION PROCESSING LETTERS, 1989, 33 (01) : 35 - 44
[44] Complete algorithm of increment for attribute reduction based on discernibility matrix
Department of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China
[J]. Hsi An Chiao Tung Ta Hsueh, 2007, 2 (158-161+208): : 158 - 161
[45] A novel parameterised approximation algorithm for MINIMUM VERTEX COVER
Brankovic, Ljiljana
Fernau, Henning
[J]. THEORETICAL COMPUTER SCIENCE, 2013, 511 : 85 - 108
[46] An evolutionary game algorithm for minimum weighted vertex cover problem
Li, Yalun
Chai, Zhengyi
Ma, Hongling
Zhu, Sifeng
[J]. SOFT COMPUTING, 2023, 27 (21) : 16087 - 16100
[47] A new efficient algorithm for weighted vertex cover in bipartite graphs based on a dual problem
Zhang Yujiao
Duan Xia
Yue Xuerong
Chen Zhibin
[J]. 2018 NINTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY IN MEDICINE AND EDUCATION (ITME 2018), 2018, : 20 - 23
[48] Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
Wang, Zhaocai
Liang, Kun
Bao, Xiaoguang
Wu, Tunhua
[J]. QUANTUM INFORMATION PROCESSING, 2023, 22 (07)
[49] Attribute Reduction Algorithm Based on the Simplified Discernibility Matrix of Granularity
Xu, Zhangyan
Wang, Xiaoyu
Zhang, Wei
[J]. INFORMATION COMPUTING AND APPLICATIONS, ICICA 2013, PT I, 2013, 391 : 563 - 572
[50] An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix
Xu, Zhang-yan
Yang, Bing-ru
Qian, Wen-bin
Shu, Wen-hao
[J]. FUZZY INFORMATION AND ENGINEERING, 2010, 2 (04) : 433 - 443

← 1 2 3 4 5 →