TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem aiming to find the smallest set of vertices such that every edge has at least one endpoint in the set. This problem has extensive applications in cybersecurity, scheduling, and monitoring link failures i...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhang, Yu, Wang, Shengzhi, Liu, Chanjuan, Zhu, Enqiang
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10535306/
https://www.ncbi.nlm.nih.gov/pubmed/37765887
http://dx.doi.org/10.3390/s23187831

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10535306/
https://www.ncbi.nlm.nih.gov/pubmed/37765887
http://dx.doi.org/10.3390/s23187831

Ejemplares similares