Rough Set Theory and Digraphs
From MaRDI portal
Publication:4599819
Recommendations
- An application of rough sets to graph theory
- Rough Set Theory Applied to Simple Undirected Graphs
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Rough fuzzy digraphs with application
- New rough sets properties on graph theory
- Rough sets and matroids
- Generalizations of rough set tools inspired by graph theory
- Rough set theory and granular computing
- The rough set theory and applications
- scientific article; zbMATH DE number 1754538
Cited in
(20)- Rough Set Theory Applied to Simple Undirected Graphs
- Indiscernibility structures induced from function sets: graph and digraph case
- Decision systems in rough set theory: a set operatorial perspective
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- New rough sets properties on graph theory
- Notions from rough set theory in a generalized dependency relation context
- Dependency and accuracy measures for directed graphs
- Dominance order on signed integer partitions
- Generalizations of rough set tools inspired by graph theory
- Preclusivity and simple graphs
- Granular computing on basic digraphs
- scientific article; zbMATH DE number 5540343 (Why is no real title available?)
- Granular computing on information tables: families of subsets and operators
- Application of rough graph in relationship mining
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- An application of rough sets to graph theory
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Simple graphs in granular computing
- Rough sets on graphs: new dependency and accuracy measures
- On the connection of hypergraph theory with formal concept analysis and rough set theory
This page was built for publication: Rough Set Theory and Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599819)
