The following pages link to Rough Set Theory and Digraphs (Q4599819):
Displaying 16 items.
- New rough approximations for \(n\)-cycles and \(n\)-paths (Q670991) (← links)
- An application of rough sets to graph theory (Q712705) (← links)
- Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
- Simple graphs in granular computing (Q1671713) (← links)
- Dominance order on signed integer partitions (Q1707382) (← links)
- On the connection of hypergraph theory with formal concept analysis and rough set theory (Q1750616) (← links)
- Granular computing on information tables: families of subsets and operators (Q2198022) (← links)
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction (Q2333783) (← links)
- Dependency and accuracy measures for directed graphs (Q2423026) (← links)
- Preclusivity and Simple Graphs (Q3300262) (← links)
- Rough Set Theory Applied to Simple Undirected Graphs (Q3300371) (← links)
- (Q3619323) (← links)
- Rough sets on graphs: New dependency and accuracy measures (Q4554547) (← 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)
- Granular computing on basic digraphs (Q5866244) (← links)
