Abstract
The minimum vertex cover (MVC) problem belongs to the class of NP-complete graph theoretical problems, which plays a central role in theoretical computer science and it has numerous real life applications. We are unlikely to find a polynomial-time algorithm for solving the vertex-cover problem exactly. In this paper, a fast heuristic algorithm, called Isolation Algorithm (IA), has been designed to find the minimum vertex cover of a graph. The IA has been tested on DIMACS benchmark graphs and BHOSLIB instances. The results of the computational experiments have shown that the IA can yield better solutions on small size graphs for solving the minimum vertex cover problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
