Simple Undirected Graphs as Formal Contexts
DOI10.1007/978-3-319-19545-2_18zbMATH Open1312.68184OpenAlexW623266001MaRDI QIDQ5255665FDOQ5255665
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
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
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)
Cites Work
- Title not available (Why is that?)
- Comparing performance of algorithms for generating concept lattices
- Title not available (Why is that?)
- From Blanché's hexagonal organization of concepts to formal concept analysis and possibility theory
- A possibility-theoretic view of formal concept analysis
- The structure of oppositions in rough set theory and formal concept analysis -- toward a new bridge between the two settings
- On bipartite and multipartite clique problems
- Consensus algorithms for the generation of all maximal bicliques
Cited In (11)
- 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
- Rough Set Theory Applied to Simple Undirected Graphs
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)
