Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Barada, Karim"'
Finding small vertex covers in a graph has applications in numerous domains. Two common formulations of the problem include: Minimum Vertex Cover, which finds the smallest vertex cover in a graph, and Parameterized Vertex Cover, which finds a vertex
Externí odkaz:
http://arxiv.org/abs/2204.10402
