Equivalent characterizations of some graph problems by covering-based rough sets
From MaRDI portal
Publication:2375570
DOI10.1155/2013/519173zbMath1283.05227OpenAlexW2095771565WikidataQ59002773 ScholiaQ59002773MaRDI QIDQ2375570
William Zhu, Shiping Wang, Fan Min, Qingxin Zhu
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/519173
matchingsindependent setsvertex coversedge coverscovering-based rough setsminimal edge cover of a graphminimal general reduct of a coveringupper approximation number
Related Items (6)
A heuristic approximation algorithm of minimum dominating set based on rough set theory ⋮ Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Simple graphs in granular computing ⋮ Connectedness of Graph and Matroid by Covering-Based Rough Sets ⋮ Rough Set Theory Applied to Simple Undirected Graphs ⋮ Finding strongly connected components of simple digraphs based on granulation strategy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attribute reduction of data with error ranges and test costs
- Data compression with homomorphism in covering information systems
- The superiority of three-way decisions in probabilistic rough set models
- Covering based rough set approximations
- Topological approaches to covering rough sets
- A novel approach to fuzzy rough sets based on a fuzzy covering
- Neighborhood rough set based heterogeneous feature subset selection
- Reduction about approximation spaces of covering generalized rough sets
- Relationship between generalized rough sets based on binary relation and covering
- Reduction and axiomization of covering generalized rough sets.
- On the differential approximation of MIN SET COVER
- Rules in incomplete information systems
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- A hierarchical model for test-cost-sensitive decision systems
- Relationship among basic concepts in covering-based rough sets
- Generalized rough sets over fuzzy lattices
- Vertex Cover: Further Observations and Further Improvements
- An Axiomatic Approach to the Roughness Measure of Rough Sets
- ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
This page was built for publication: Equivalent characterizations of some graph problems by covering-based rough sets
