Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Bipartite Graphs and Coverings
verfasst von : Shiping Wang, William Zhu, Fan Min
Erschienen in: Rough Sets and Knowledge Technology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In many real world applications, data are organized by coverings, instead of partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to applications. Covering is one of core concepts in covering-based rough sets, and it is urgent to connect coverings with other data models. This paper establishes the relationship between coverings and bipartite graphs. Through its index set, a covering induces some isomorphic bipartite graphs. Conversely, a bipartite graph induces a covering of the set of vertices. These inductions are converse with each other.