Laddar...

Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets

Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets. Specifically, we convert some important concepts in graph theory including vertex covers, independent se...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Shiping Wang, Qingxin Zhu, William Zhu, Fan Min
Materialtyp: Artigo
Språk:Inglês
Publicerad: Hindawi Limited 2013-01-01
Serie:Journal of Applied Mathematics
Länkar:http://dx.doi.org/10.1155/2013/519173
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!