no code implementations • 4 Feb 2021 • Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph $G$ and a positive integer $k$, and the objective is to decide whether $G$ contains a minimal vertex cover of size at least $k$.
Data Structures and Algorithms Computational Complexity 05C15 G.2.2; F.2.2
