The relationship between attribute reducts in rough sets and minimal vertex covers of graphs

The problems to find attribute reduction in rough sets and to obtain the minimal vertex cover for graphs are both NP-hard problems. This paper studies the relationship between the two problems. The vertex cover problem for graphs from the perspective of rough sets is first investigated. The attribut...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information sciences 2015-12, Vol.325, p.87-97
Hauptverfasser:	Chen, Jinkun, Lin, Yaojin, Lin, Guoping, Li, Jinjin, Ma, Zhouming
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Attribute reduction Derivatives Equivalence Graph theory Graphs Information systems Mathematical analysis Rough set models Rough sets Vertex covers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!