Rough Set Theory Applied to Simple Undirected Graphs

DOI10.1007/978-3-319-25754-9_37zbMath1444.68219OpenAlexW2293094215MaRDI QIDQ3300371

Davide Ciucci, F. Infusino, Giampiero Chiaselotti, Tommaso Gentile

Publication date: 28 July 2020

Published in: Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25754-9_37

zbMATH Keywords

symmetrybipartite graphscomplete graphsdiscernibility matrixneighborhoodundirected graphs

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (8)

Indiscernibility structures induced from function sets : Graph and digraph case ⋮ The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Simple graphs in granular computing ⋮ Dependency structures for decision tables ⋮ Dependency and accuracy measures for directed graphs ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ The granular partition lattice of an information table ⋮ Finding strongly connected components of simple digraphs based on granulation strategy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An application of rough sets to graph theory
• Simple graphs in granular computing
• On the connection of hypergraph theory with formal concept analysis and rough set theory
• Matroidal structure of rough sets from the viewpoint of graph theory
• Equivalent characterizations of some graph problems by covering-based rough sets
• Simple Undirected Graphs as Formal Contexts

This page was built for publication: Rough Set Theory Applied to Simple Undirected Graphs