A graph theoretical approach for node covering in tree based architectures and its application to bioinformatics

Author:

D. Angel

Publisher

Springer Science and Business Media LLC

Subject

Urology

Reference17 articles.

1. Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1):123–134

2. Auyeung A, Abraham A (2004) The largest compatible subset problem for phylogenetic data, genetic and evolutionary computation 2004 conference (GECCO-2004), bird-of-a-feather workshop on application of hybrid evolutionary algorithms to complex optimization problems. Springer, Berlin, pp 1–11

3. Babar ME, Pervez MT, Nadeem A, Hussain T, Aslam N (2014) Multiple sequence alignment tools: assessing performance of the underlying algorithms. J Appl Environ Biol Sci 4(8S):76–80

4. Chen J, Kanj IA, Xia G (2010) Improved upper bounds for vertex cover. Theor Comput Sci 411:3736–3756

5. Chen J, Lin Y, Li J, Lin G, Ma Z, Tan A (2016) A rough set method for the minimum vertex cover problem of graphs”. Appl Soft Comput 42:360–367

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

1. An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks;Algorithms;2024-02-06

2. Application of Graph theory to Defend Hypercubes and Matching Graph of Hypercube Structures Against Cyber Threats;2023 First International Conference on Advances in Electrical, Electronics and Computational Intelligence (ICAEECI);2023-10-19

3. A new approach for solving the minimum vertex cover problem using artificial bee colony algorithm;Decision Analytics Journal;2023-03

4. On M-Polynomials and Covering of Cube Connected Cycles;2023 Third International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT);2023-01-05

5. Protection of Medical Information Systems Against Cyber Attacks: A Graph Theoretical Approach;Wireless Personal Communications;2022-06-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3