Solving Minimum Vertex Cover Problem Using Learning Automata

28 Nov 2013Aylin MousavianAlireza RezvanianMohammad Reza Meybodi

Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph. In this paper, a learning automaton based algorithm is proposed to find minimum vertex cover in graph... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.