A Heuristic Approach to Fast NOVCA (Near Optimal Vertex Cover Algorithm)

Abstract

This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of (1) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by… (More)

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Gajurel2014AHA, title={A Heuristic Approach to Fast NOVCA (Near Optimal Vertex Cover Algorithm)}, author={Sanjaya Gajurel and Roger Bielefeld}, year={2014} }