Login / Signup
A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix.
Shengyang Zhuang
Degang Chen
Published in:
Int. J. Mach. Learn. Cybern. (2019)
Keyphrases
</>
vertex cover
objective function
np hard
learning algorithm
information entropy
worst case
simulated annealing
approximation algorithms
planar graphs
computational complexity
expectation maximization
tree structure