New rough approximations for \(n\)-cycles and \(n\)-paths
From MaRDI portal
Publication:670991
DOI10.1016/j.amc.2015.11.052zbMath1410.68355OpenAlexW2198972876MaRDI QIDQ670991
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.11.052
rough setssimple graphattribute dependency functionBoolean information systempositive regionsrough membership function
Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (17)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Locally finite complexes, modules and generalized information systems ⋮ Dependency structures for decision tables ⋮ Some classes of abstract simplicial complexes motivated by module theory ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ SYMMETRY GEOMETRY BY PAIRINGS ⋮ Pairings and related symmetry notions ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Dominance-based rough sets in multi-scale intuitionistic fuzzy decision tables ⋮ Dependency relations ⋮ Lattice representations with set partitions induced by pairings ⋮ The granular partition lattice of an information table ⋮ Set relations and set systems induced by some families of integral domains ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ Granular computing on basic digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel discrete dynamical systems on independent local functions
- Rudiments of rough sets
- Rough sets: some extensions
- Rough sets and Boolean reasoning
- Cellular automata as a paradigm for ecological modeling
- Information systems theoretical foundations
- Cellular automata model for the diffusion equation
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Parallel discrete dynamical systems on maxterm and minterm Boolean functions
- Sand piles models of signed partitions with \(d\) piles
- On some numbers related to extremal combinatorial sum problems
- Parallel dynamical systems over graphs and related topics: a survey
- Parallel rank of two sandpile models of signed integer partitions
- A discrete dynamical model of signed partitions
- Parallel dynamical systems over directed dependency graphs
- A natural extension of the Young partition lattice
- Rough sets
- A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture
- Simple Undirected Graphs as Formal Contexts
- Parallel dynamical systems over special digraph classes
This page was built for publication: New rough approximations for \(n\)-cycles and \(n\)-paths
