Pages that link to "Item:Q712705"
From MaRDI portal
The following pages link to An application of rough sets to graph theory (Q712705):
Displaying 18 items.
- Multigranulation rough sets: from partition to covering (Q497267) (← links)
- Graph and matrix approaches to rough sets through matroids (Q508728) (← links)
- On distribution function of the diameter in uncertain graph (Q527187) (← links)
- Roughness and fuzziness in quantales. (Q726315) (← links)
- An application of fuzzy hypergraphs and hypergraphs in granular computing (Q781861) (← links)
- Simple graphs in granular computing (Q1671713) (← links)
- Generalized rough fuzzy ideals in quantales (Q1726956) (← links)
- New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
- On topological spaces generated by simple undirected graphs (Q2132127) (← links)
- A multigranulation fuzzy rough approach to multisource information systems (Q2156998) (← links)
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction (Q2238210) (← links)
- Boundary region-based rough sets and uncertainty measures in the approximation space (Q2282133) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- A rough set method for the vertex cover problem in graph theory (Q2987912) (← links)
- Preclusivity and Simple Graphs (Q3300262) (← links)
- Rough Set Theory Applied to Simple Undirected Graphs (Q3300371) (← links)
- Rough sets on graphs: New dependency and accuracy measures (Q4554547) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)