Mutated Near Optimal Vertex Cover Algorithm (NOVCA) Visualization on a Tile Display
Sanjaya Gajurel, Roger A. Bielefeld · 2015
This poster visualizes the mutated version of extremely fast polynomial time algorithm, NOVCA (Near Optimal Vertex Cover Algorithm). NOVCA is based on the idea of including the vertex having higher degree in the cover. Mutation is introduced in NOVCA by randomly selecting any remaining vertex having degree greater than 1 in the cover as an exception.