BibTeX
CSL-JSON
MLA
Harvard
Neighbourhood Evaluation Criteria for Vertex Cover Problem
release_7tbejfmrvzgvxgulussuwspaay
by
Kaustubh K Joshi
Released
as a article
.
2020
Abstract
Neighbourhood Evaluation Criteria is a heuristical approximate algorithm that
attempts to solve the Minimum Vertex Cover. degree count is kept in check for
each vertex and the highest count based vertex is included in our cover set. In
the case of multiple equivalent vertices, the one with the lowest neighbourhood
influence is selected. In the case of still existing multiple equivalent
vertices, the one with the lowest remaining active vertex count (the highest
Independent Set enabling count) is selected as a tie-breaker.
In text/plain
format
Archived Files and Locations
application/pdf 327.4 kB
file_rw77z6c3izbh7e4dtakjz2ovle
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
2005.05065v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links