Login / Signup
DNA solution based on triangle subgraph to the vertex cover problem.
Aili Han
Published in:
BIC-TA (2010)
Keyphrases
</>
vertex cover
approximation algorithms
optimal solution
reinforcement learning
computational complexity
np hard
complex networks
planar graphs