Simple Undirected Graphs as Formal Contexts

DOI10.1007/978-3-319-19545-2_18MaRDI QIDQ5255665zbMATH OpenOpenAlexFDO

Authors Davide Ciucci, G. Chiaselotti, T. Gentile

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

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

Recommendations

• Context Graphs — Representing Formal Concepts by Connected Subgraphs
• Underlying simple graphs
• scientific article; zbMATH DE number 3978423
• scientific article; zbMATH DE number 2185702
• Simple Conceptual Graphs and Simple Concept Graphs
• The structural formula version of graph theory
• An axiomatization of graphs
• Simple graphs in granular computing
• Semantics for existential graphs

Cites work

• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• A possibility-theoretic view of formal concept analysis
• Comparing performance of algorithms for generating concept lattices
• 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
• The structure of oppositions in rough set theory and formal concept analysis -- toward a new bridge between the two settings

Cited in

(11)

• Rough Set Theory Applied to Simple Undirected Graphs
• Indiscernibility structures induced from function sets: graph and digraph case
• The adjacency matrix of a graph as a data table: a geometric perspective
• Context Graphs — Representing Formal Concepts by Connected Subgraphs
• Dependency and accuracy measures for directed graphs
• Preclusivity and simple graphs
• Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
• The granular partition lattice of an information table
• Dependency structures for decision tables
• New rough approximations for \(n\)-cycles and \(n\)-paths
• Simple graphs in granular computing

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

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