Granular computing on basic digraphs
From MaRDI portal
Publication:5866244
DOI10.2298/AADM180615001CzbMath1499.05601OpenAlexW4226149073MaRDI QIDQ5866244
F. Infusino, Tommaso Gentile, Giampiero Chiaselotti
Publication date: 13 June 2022
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm180615001c
Applications of graph theory (05C90) Reasoning under uncertainty in the context of artificial intelligence (68T37) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compound approximation spaces for relational data
- A new discrete dynamical system of signed integer partitions
- Clique cycle-transversals in distance-hereditary graphs
- Graph and matrix approaches to rough sets through matroids
- Generalized three-way decision models based on subset evaluation
- A Landau's theorem in several complex variables
- Average time complexity of decision trees.
- Information systems in modeling interactive computations on granules
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Interactive information systems: toward perception based computing
- Hypergraph families with bounded edge cover or transversal number
- Rudiments of rough sets
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- The strong metric dimension of graphs and digraphs
- Nullity-based matroid of rough sets and its application to attribute reduction
- Lower bounds for three algorithms for transversal hypergraph generation
- Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
- Resolvability in graphs and the metric dimension of a graph
- Notions from rough set theory in a generalized dependency relation context
- Simple graphs in granular computing
- Dominance order on signed integer partitions
- Rough mereology: A new paradigm for approximate reasoning
- Cycle transversals in perfect graphs and cographs
- A matroidal approach to rough set theory
- Alexandroff topologies and monoid actions
- Some classes of abstract simplicial complexes motivated by module theory
- Granular computing on information tables: families of subsets and operators
- Lattice representations with set partitions induced by pairings
- The granular partition lattice of an information table
- On periods and equilibria of computational sequential systems
- Set relations and set systems induced by some families of integral domains
- Three-way fuzzy matroids and granular computing
- Approximation via a double-matroid structure
- The adjacency matrix of a graph as a data table: a geometric perspective
- Description and classification of complex structured objects by applying similarity measures
- Decision bireducts and decision reducts -- a comparison
- Dependency and accuracy measures for directed graphs
- Association discovery from relational data via granular computing
- Rough matroids based on relations
- A natural extension of the Young partition lattice
- Unifying Rough Set Theories via Large Scaled Granular Computing
- On the Problem of Boundaries from Mereology and Rough Mereology Points of View
- On Generalized Decision Functions: Reducts, Networks and Ensembles
- Granular Rough Mereological Logics with Applications to Dependencies in Information and Decision Systems
- Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
- Granular Sets – Foundations and Case Study of Tolerance Spaces
- Rough sets on graphs: New dependency and accuracy measures
- Generalizations of Rough Set Tools Inspired by Graph Theory
- Rough Set Theory and Digraphs
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Local dissymmetry on graphs and related algebraic structures
- Extending bicolorings for Steiner triple systems
- Transactions on Rough Sets I
- Rough Set Characterization for 2-circuit Matroid
- Updating method for the computation of orbits in parallel and sequential dynamical systems
- Digraphs
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Granular computing. An emerging paradigm
This page was built for publication: Granular computing on basic digraphs
