Pages that link to "Item:Q4606359"
From MaRDI portal
The following pages link to Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets (Q4606359):
Displaying 13 items.
- An application of rough sets to graph theory (Q712705) (← links)
- Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets (Q1726324) (← links)
- New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
- Some classes of abstract simplicial complexes motivated by module theory (Q2196332) (← links)
- Fuzzy \(\beta \)-covering approximation spaces (Q2206460) (← links)
- Lattice representations with set partitions induced by pairings (Q2290345) (← links)
- Set relations and set systems induced by some families of integral domains (Q2295472) (← links)
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction (Q2333783) (← links)
- Equivalent characterizations of some graph problems by covering-based rough sets (Q2375570) (← links)
- Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets (Q2666871) (← links)
- Granular computing on basic digraphs (Q5866244) (← links)
- Matrix approach for fuzzy description reduction and group decision-making with fuzzy \(\beta\)-covering (Q6118892) (← links)
- Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces (Q6188160) (← links)
