Exact Algorithms for Dist
Exact Algorithms for Distance to Unique Vertex Cover
Exact Algorithms for Distance to Unique Vertex Cover
arXiv:2502.05059v1 Announce Type: new
Abstract: Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach involved pre-assigning certain vertices to be part of the solution or excluding them fro…
