Simple Undirected Graphs as Formal Contexts

DOI10.1007/978-3-319-19545-2_18zbMath1312.68184OpenAlexW623266001MaRDI QIDQ5255665

Davide Ciucci, Tommaso Gentile, Giampiero Chiaselotti

Publication date: 16 June 2015

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10281/83422

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

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 ⋮ Preclusivity and Simple Graphs ⋮ Preclusivity and Simple Graphs: The n–cycle and n–path Cases ⋮ Rough Set Theory Applied to Simple Undirected Graphs ⋮ New rough approximations for \(n\)-cycles and \(n\)-paths ⋮ The granular partition lattice of an information table

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consensus algorithms for the generation of all maximal bicliques
• From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory
• On Bipartite and Multipartite Clique Problems
• Comparing performance of algorithms for generating concept lattices
• The Structure of Oppositions in Rough Set Theory and Formal Concept Analysis - Toward a New Bridge between the Two Settings

This page was built for publication: Simple Undirected Graphs as Formal Contexts