Pages that link to "Item:Q2375570"
From MaRDI portal
The following pages link to Equivalent characterizations of some graph problems by covering-based rough sets (Q2375570):
Displaying 9 items.
- An application of rough sets to graph theory (Q712705) (← links)
- Simple graphs in granular computing (Q1671713) (← links)
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs (Q1750334) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- Finding strongly connected components of simple digraphs based on granulation strategy (Q2302953) (← links)
- Connectedness of graphs and its application to connected matroids through covering-based rough sets (Q2402114) (← links)
- Connectedness of Graph and Matroid by Covering-Based Rough Sets (Q3300264) (← links)
- Rough Set Theory Applied to Simple Undirected Graphs (Q3300371) (← links)
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets (Q4606359) (← links)