A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Machine Learning and Cybernetics"
DOI: 10.1007/s13042-019-00933-6
Abstract: Minimal vertex cover problem (MVCP) is a famous important NP-hard problem in graph theory. It has been reported that MVCP is equivalent to finding reducts of information systems in rough sets theory. This relationship motivates… read more here.
Keywords: cover problem; minimal elements; vertex cover; discernibility matrix ... See more keywords