Generalizations of rough set tools inspired by graph theory
From MaRDI portal
(Redirected from Publication:4589231)
Recommendations
Cited in
(20)- Rough Set Theory Applied to Simple Undirected Graphs
- Indiscernibility structures induced from function sets: graph and digraph case
- Locally finite complexes, modules and generalized information systems
- Decision systems in rough set theory: a set operatorial perspective
- Finding single-source shortest paths from unweighted directed graphs combining rough sets theory and marking strategy
- The introduction and utilization of (l,u)-graphs in the extended variable precision rough sets model
- Approximation via a double-matroid structure
- Notions from rough set theory in a generalized dependency relation context
- Dependency and accuracy measures for directed 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
- The granular partition lattice of an information table
- Granular computing in zero-divisor graphs of \(\mathbb{Z}_n\)
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Finding strongly connected components of simple digraphs based on granulation strategy
- Simple graphs in granular computing
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Graphical partitions and graphical relations
- Rough Set Theory and Digraphs
This page was built for publication: Generalizations of rough set tools inspired by graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589231)
