A rough set method for the minimum vertex cover problem of graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A rough set method for the minimum vertex cover problem of graphs

Published:2016-05 Issue: Volume:42 Page:360-367
ISSN:1568-4946
Container-title:Applied Soft Computing
language:en
Short-container-title:Applied Soft Computing

Author:

Chen Jinkun,Lin Yaojin,Li Jinjin,Lin Guoping,Ma Zhouming,Tan Anhui

Funder

National Natural Science Foundation of China

Department of Education of Fujian Province

Natural Science Foundation of Fujian Province

Publisher

Elsevier BV

Subject

Software

Reference64 articles.

1. A list heuristic for vertex cover;Avis;Oper. Res. Lett.,2007

2. Optimization of unweighted minimum vertex cover;Balaji;World Acad. Sci. Eng. Technol.,2010

3. Resynchronization for multiprocessor DSP systems;Bhattacharyya;IEEE Trans. Circuits Syst I: Fundam. Theory Appl.,2000

4. Random Graphs;Bollobas,2001

5. Graph Theory with Applications;Bondy,1976

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Serial Game Distributed Algorithm to $\epsilon$-Minimum Vertex Cover of Networks in Finite Time;IEEE Transactions on Automation Science and Engineering;2024

2. A novel rough set-based approach for minimum vertex cover of hypergraphs;Neural Computing and Applications;2022-08-03

3. A heuristic approximation algorithm of minimum dominating set based on rough set theory;Journal of Combinatorial Optimization;2022-04-24

4. Vertex Cover Optimization Using a Novel Graph Decomposition Approach;Computers, Materials & Continua;2022

5. Rough set analysis of graphs;Filomat;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP