A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm.

Selman Yakut Furkan Öztemiz Ali Karci

Published in: J. Supercomput. (2023)

Keyphrases

vertex cover
np hard
computational complexity
dynamic programming
objective function
search space
special case
learning algorithm
expectation maximization
theoretical analysis
approximation algorithms
worst case
undirected graph
minimum spanning tree
approximation ratio