TIVC: An Efficient Local Search Algorithm for Minimum Vertex Cover in Large Graphs
The minimum vertex cover (MVC) problem is a canonical <b>NP</b>-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 monitor...
| Main Authors: | , , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
MDPI AG
2023-09-01
|
| 丛编: | Sensors |
| 主题: | |
| 在线阅读: | https://www.mdpi.com/1424-8220/23/18/7831 |