Abstract
In this paper, we first establish a Multi-Relation Granular Computing model by a given graph, and point out that all the reducts of the constructed Multi-Relation Granular Computing model are exactly all the minimal vertex covers of the corresponding graph. Thus, the vertex cover problem in graph theory can be converted to the knowledge reduction problem in rough set theory. Based on the conversion, we then introduce methods for dealing with the knowledge reduction problem to solve the vertex cover problem. In particular, we introduce a kind of method called the heuristic reduction algorithm based on entropy.
Sign-in/Register to access full text options 
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.
