Rough Set Theory and Digraphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, Federico G. Infusino · Fundamenta Informaticae · 2017
In this paper we apply rough set theory to information tables induced from finite directed graphs without loops and multiples arcs (digraphs). Specifically, we use the adjacency matrix of a digraph as a particular type of information table. In this way, we are able to explore on digraphs the notions of indiscernibility partitions, lower and upper approximations, generalized core, reducts and discernibility matrix. All these ideas will be exemplified on standard digraph families as well on examples from social networks and patterns of flight routes between airports.