Pages that link to "Item:Q3300371"
From MaRDI portal
The following pages link to Rough Set Theory Applied to Simple Undirected Graphs (Q3300371):
Displaying 14 items.
- New rough approximations for \(n\)-cycles and \(n\)-paths (Q670991) (← links)
- An application of rough sets to graph theory (Q712705) (← links)
- Simple graphs in granular computing (Q1671713) (← links)
- The granular partition lattice of an information table (Q2293047) (← links)
- Finding strongly connected components of simple digraphs based on granulation strategy (Q2302953) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
- Dependency structures for decision tables (Q2411274) (← links)
- Dependency and accuracy measures for directed graphs (Q2423026) (← links)
- Rough Set Theory and Digraphs (Q4599819) (← links)
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets (Q4606359) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
- Decision systems in rough set theory: A set operatorial perspective (Q5376483) (← links)
- Graphical Partitions and Graphical Relations (Q5377316) (← links)