New rough approximations for n-cycles and n-paths

DOI10.1016/J.AMC.2015.11.052MaRDI QIDQ670991zbMATH OpenOpenAlexFDO

Authors Silvia M. Sanahuja

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

zbMATH Keywords

attribute dependency functionBoolean information systempositive regionsrough membership functionrough setssimple graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Rough Set Theory Applied to Simple Undirected Graphs
• Rough Set Theory and Digraphs
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough sets on graphs: new dependency and accuracy measures
• An application of rough sets to graph theory

Cites work

• A class of lattices and Boolean functions related to the Manickam-Miklös-Singhi conjecture
• A discrete dynamical model of signed partitions
• A natural extension of the Young partition lattice
• Cellular automata as a paradigm for ecological modeling
• Cellular automata model for the diffusion equation
• Graph theory
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• Information systems theoretical foundations
• Lattices of partial sums.
• On some numbers related to extremal combinatorial sum problems
• Parallel and sequential dynamics of two discrete models of signed integer partitions
• Parallel discrete dynamical systems on independent local functions
• Parallel discrete dynamical systems on maxterm and minterm Boolean functions
• Parallel dynamical systems over directed dependency graphs
• Parallel dynamical systems over graphs and related topics: a survey
• Parallel dynamical systems over special digraph classes
• Parallel rank of two sandpile models of signed integer partitions
• Rough sets
• Rough sets and Boolean reasoning
• Rough sets: some extensions
• Rudiments of rough sets
• Sand piles models of signed partitions with d piles
• Simple Undirected Graphs as Formal Contexts

Cited in

(19)

• Notions from rough set theory in a generalized dependency relation context
• 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
• Some classes of abstract simplicial complexes motivated by module theory
• 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
• Dependency structures for decision tables
• Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
• E-rough analysis on undirected networks
• Rough sets on graphs: new dependency and accuracy measures
• Indiscernibility structures induced from function sets: graph and digraph case
• Locally finite complexes, modules and generalized information systems
• Decision systems in rough set theory: a set operatorial perspective
• Symmetry geometry by pairings
• Some classifications of graphs with respect to a set adjacency relation
• Granular computing on basic digraphs

This page was built for publication: New rough approximations for \(n\)-cycles and \(n\)-paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670991)