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...
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
-
Covering-Based Rough Sets on Eulerian Matroids
by: Bin Yang, et al.
Published: (2013-01-01) -
Cost-Sensitive Attribute Reduction in Decision-Theoretic Rough Set Models
by: Shujiao Liao, et al.
Published: (2014-01-01) -
A Variable Precision Covering-Based Rough Set Model Based on Functions
by: Yanqing Zhu, et al.
Published: (2014-01-01) -
Geometric Lattice Structure of Covering-Based Rough Sets through Matroids
by: Aiping Huang, et al.
Published: (2012-01-01) -
SOME PROPERTIES OF INDUCED COVER FROM FAMILY OF COVERING ROUGH SETS
by: Nguyễn Đức Thuần
Published: (2017-09-01)