Abstract
The adjacency matrix of a graph is interpreted as a formal context. Then, the counterpart of Formal Concept Analysis (FCA) tools are introduced in graph theory. Moreover, a formal context is seen as a Boolean information table, the structure at the basis of Rough Set Theory (RST). Hence, we also apply RST tools to graphs. The peculiarity of the graph case, put in evidence and studied in the paper, is that both FCA and RST are based on a (different) binary relation between objects.
Cite
CITATION STYLE
Chiaselotti, G., Ciucci, D., & Gentile, T. (2015). Simple undirected graphs as formal contexts. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 9113, pp. 287–302). Springer Verlag. https://doi.org/10.1007/978-3-319-19545-2_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
