An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks
Author:
Affiliation:
1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi Milano-Bicocca, 20126 Milano, Italy
2. Dipartimento di Lettere, Filosofia, Comunicazione, Università degli Studi di Bergamo, 24129 Bergamo, Italy
Abstract
Publisher
MDPI AG
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Link
https://www.mdpi.com/1999-4893/17/2/72/pdf
Reference54 articles.
1. Angel, D. (2019). A graph theoretical approach for node covering in tree based architectures and its application to bioinformatics. Netw. Model. Anal. Health Inf. Bioinform., 8.
2. Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks;Yigit;Comput. Netw.,2021
3. Cheng, T.M.K., Lu, Y.E., Vendruscolo, M., Lio’, P., and Blundell, T.L. (2019). Prediction by graph theoretic measures of structural effects in proteins arising from non-synonymous single nucleotide polymorphisms. Netw. Model. Anal. Health Inf. Bioinform., 8.
4. Text summarisation using Laplacian centrality-based minimum vertex cover;Gupta;J. Inf. Knowl. Manag.,2019
5. Probierz, B., Hrabia, A., and Kozak, J. (2023). A New Method for Graph-Based Representation of Text in Natural Language Processing. Electronics, 12.
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3