Granular computing on basic digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- A Landau's theorem in several complex variables
- A matroidal approach to rough set theory
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- Alexandroff topologies and monoid actions
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Approximation via a double-matroid structure
- Association discovery from relational data via granular computing
- Average time complexity of decision trees.
- Clique cycle-transversals in distance-hereditary graphs
- Compound approximation spaces for relational data
- Cycle transversals in perfect graphs and cographs
- Decision bireducts and decision reducts -- a comparison
- Dependency and accuracy measures for directed graphs
- Description and classification of complex structured objects by applying similarity measures
- Digraphs
- Dominance order on signed integer partitions
- Extending bicolorings for Steiner triple systems
- Generalizations of rough set tools inspired by graph theory
- Generalized three-way decision models based on subset evaluation
- Granular computing on information tables: families of subsets and operators
- Granular computing. An emerging paradigm
- Granular rough mereological logics with applications to dependencies in information and decision systems
- Granular sets -- foundations and case study of tolerance spaces
- Graph and matrix approaches to rough sets through matroids
- Hypergraph families with bounded edge cover or transversal number
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Information systems in modeling interactive computations on granules
- Interactive information systems: toward perception based computing
- Lattice representations with set partitions induced by pairings
- Local dissymmetry on graphs and related algebraic structures
- Lower bounds for three algorithms for transversal hypergraph generation
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Notions from rough set theory in a generalized dependency relation context
- Nullity-based matroid of rough sets and its application to attribute reduction
- On generalized decision functions: reducts, networks and ensembles
- On periods and equilibria of computational sequential systems
- On the problem of boundaries from mereology and rough mereology points of view
- Resolvability in graphs and the metric dimension of a graph
- Rough Set Theory and Digraphs
- Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
- Rough matroids based on relations
- Rough mereology: A new paradigm for approximate reasoning
- Rough set characterization for 2-circuit matroid
- Rough sets and Boolean reasoning
- Rough sets on graphs: new dependency and accuracy measures
- Rough sets: some extensions
- Rudiments of rough sets
- Set relations and set systems induced by some families of integral domains
- Simple graphs in granular computing
- Some classes of abstract simplicial complexes motivated by module theory
- Temporal dynamics in information tables
- The adjacency matrix of a graph as a data table: a geometric perspective
- The granular partition lattice of an information table
- The strong metric dimension of graphs and digraphs
- Three-way fuzzy matroids and granular computing
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Transactions on Rough Sets I
- Unifying rough set theories via large scaled granular computing
- Updating method for the computation of orbits in parallel and sequential dynamical systems
Cited in
(5)- The adjacency matrix of a graph as a data table: a geometric perspective
- Interpretation of Extended Pawlak Flow Graphs Using Granular Computing
- Dependency and accuracy measures for directed graphs
- Finding strongly connected components of simple digraphs based on granulation strategy
- Simple graphs in granular computing
This page was built for publication: Granular computing on basic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866244)
