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 description

Bibliographic Details
Main Authors: Shiping Wang, Qingxin Zhu, William Zhu, Fan Min
Format: Article
Language:English
Published: Hindawi Limited 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/519173

Similar Items