Now showing items 1-1 of 1
A localized distributed algorithm for vertex cover problem
(Elsevier B.V., 2022)
Finding the minimum vertex cover of a given graph is a well-known NP-Hard problem that has many applications in various fields. In this paper, we propose a distributed localized algorithm for detecting vertex cover using ...