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

被引：0
|
作者：
Shengyang Zhuang
Degang Chen
机构：
[1] North China Electric Power University,School of Mathematics and Physics
来源：
International Journal of Machine Learning and Cybernetics | 2019年 / 10卷
关键词：
Vertex cover; Attribute reduction; Discernibility matrix; Minimal element;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：7
相关论文
共 50 条
  • [1] A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
    Zhuang, Shengyang
    Chen, Degang
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2019, 10 (12) : 3467 - 3474
  • [2] A surface-based DNA algorithm for the minimal vertex cover problem
    PAN Linqiang
    Department of Mathematics and Physics
    [J]. Progress in Natural Science:Materials International, 2003, (01) : 80 - 82
  • [3] A surface-based DNA algorithm for the minimal vertex cover problem
    Pan, LQ
    Xu, J
    Liu, YC
    [J]. PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2003, 13 (01) : 78 - 80
  • [4] Discernibility matrix based algorithm for reduction of attributes
    Wang, Ruizhi
    Miao, Duoqian
    Hu, Guirong
    [J]. 2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WORKSHOPS PROCEEDINGS, 2006, : 477 - +
  • [5] An Exact Algorithm for Minimum Vertex Cover Problem
    Wang, Luzhi
    Hu, Shuli
    Li, Mingyang
    Zhou, Junping
    [J]. MATHEMATICS, 2019, 7 (07)
  • [6] A localized distributed algorithm for vertex cover problem
    Akram, Vahid Khalilpour
    Ugurlu, Onur
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2022, 58
  • [7] An Approximation Algorithm for the Minimum Vertex Cover Problem
    Chen, Jingrong
    Kou, Lei
    Cui, Xiaochuan
    [J]. GREEN INTELLIGENT TRANSPORTATION SYSTEM AND SAFETY, 2016, 138 : 180 - 185
  • [8] A New Approximation Algorithm for Vertex Cover Problem
    Dahiya, Sonika
    [J]. 2013 INTERNATIONAL CONFERENCE ON MACHINE INTELLIGENCE AND RESEARCH ADVANCEMENT (ICMIRA 2013), 2013, : 472 - 478
  • [9] A Minimal Memory Game-based Distributed Algorithm to Vertex Cover of Networks
    Chen, Jie
    Li, Xiang
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2021,
  • [10] A discernibility matrix based algorithm for feature selection
    Liu, Fuyan
    [J]. 2006 International Conference on Computational Intelligence and Security, Pts 1 and 2, Proceedings, 2006, : 155 - 158
12345