Access Restriction

Author Kettani, Omar ♦ Ramdani, Faycal ♦ Tadili, Benaissa
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Heuristic Approach ♦ Vertex Cover Problem ♦ Np-hard Graph Theoretical Problem ♦ Minimum Sized Vertex Cover ♦ Test Result ♦ Various Field ♦ Minimum Vertex Cover Problem ♦ Vertex Cover ♦ Vertex Set ♦ Graph Example ♦ Novel Heuristic Algorithm ♦ Many Practical Application
Abstract A vertex cover is a subset of the vertex set of a given graph G such that every edge in G has at least one endpoint in this set. The Minimum Vertex Cover problem consists to find the minimum sized vertex cover in a graph. This problem which belongs to the class of NP-hard graph theoretical problems, has many practical applications in various fields. In this article, we propose a novel heuristic algorithm for solving this problem. The test results obtained on some graph examples available in the literature confirm the effectiveness of the proposed method.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2013-01-01