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

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...

Full description

Bibliographic Details
Main Authors: Yu Zhang, Shengzhi Wang, Chanjuan Liu, Enqiang Zhu
Format: Article
Language:English
Published: MDPI AG 2023-09-01
Series:Sensors
Subjects:
minimum vertex cover (MVC)
local search
wireless sensor networks (WSNs)
combinatorial optimization
large graphs
Online Access:https://www.mdpi.com/1424-8220/23/18/7831

Internet

https://www.mdpi.com/1424-8220/23/18/7831

Similar Items