Indiscernibility structures induced from function sets: graph and digraph case
From MaRDI portal
Publication:5031926
Recommendations
- Simplicial complexes and closure systems induced by indistinguishability relations
- scientific article; zbMATH DE number 3934436
- Rough Set Theory Applied to Simple Undirected Graphs
- Some properties of the indiscernibility relation in rough sets
- Multiple-Source Approximation Systems: Membership Functions and Indiscernibility
Cites work
- A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
- A matroidal approach to rough set theory
- A natural extension of the Young partition lattice
- A new discrete dynamical system of signed integer partitions
- Algebraic dependencies
- An application of rough sets to graph theory
- Combinatorics of sequential dynamical systems
- Concept lattices and conceptual knowledge systems
- Degrees of acyclicity for hypergraphs and relational database schemes
- Dependency structures for decision tables
- Digraphs
- Dominance order on signed integer partitions
- Elements of a theory of computer simulation. I
- Elements of a theory of simulation. II: Sequential dynamical systems.
- Elements of a theory of simulation. III: Equivalence of SDS.
- ETS IV: Sequential dynamical systems: fixed points, invertibility and equivalence
- Euler’s “De Partitio Numerorum”
- Extending bicolorings for Steiner triple systems
- Generalizations of rough set tools inspired by graph theory
- Granular computing. An emerging paradigm
- Graph and matrix approaches to rough sets through matroids
- Graph theory
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- Hypergraph families with bounded edge cover or transversal number
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Improved approximation of maximum vertex coverage problem on bipartite graphs
- Information granulation and rough set approximation
- Intersection properties of maximal directed cuts in digraphs
- Lower bounds for three algorithms for transversal hypergraph generation
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Nesting House-designs
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Nullity-based matroid of rough sets and its application to attribute reduction
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- On the Galois lattice of bipartite distance hereditary graphs
- Pairings and related symmetry notions
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Power contexts and their concept lattices
- Preclusivity and simple graphs
- Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Relations on hypergraphs
- Representation of functional dependencies in relational databases using linear graphs
- Rough set characterization for 2-circuit matroid
- Rough Set Theory and Digraphs
- Rough Set Theory Applied to Simple Undirected Graphs
- Selective inheritance of attribute values in relational databases
- Self-organized criticality
- Simple graphs in granular computing
- Simple Undirected Graphs as Formal Contexts
- Subdirect product construction of concept lattices
- Temporal dynamics in information tables
- The adjacency matrix of a graph as a data table: a geometric perspective
- The basic theorem of triadic concept analysis
- The granular partition lattice of an information table
- The Lattice Structure of Equally Extended Signed Partitions
- The maximum vertex coverage problem on bipartite graphs
- Transactions on Rough Sets I
- Union-closed families
Cited in
(4)
This page was built for publication: Indiscernibility structures induced from function sets: graph and digraph case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031926)
