Representing a concept lattice by a graph

DOI10.1016/j.dam.2004.02.016zbMath1052.06006OpenAlexW2150965716MaRDI QIDQ1885806

Anne Berry, Alain Sigayret

Publication date: 12 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.02.016

zbMATH Keywords

Galois latticeMinimal separatorCo-bipartite graphConcept lattice

Mathematics Subject Classification ID

Artificial intelligence (68T99) Graph theory (05C99) Lattices (06B99)

Related Items

A local approach to concept generation ⋮ Knowledge representation using interval-valued fuzzy formal concept lattice ⋮ Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph ⋮ Complex vague set based concept lattice ⋮ Representing attribute reduction and concepts in concept lattice using graphs ⋮ A rough set method for the vertex cover problem in graph theory ⋮ A note on bipolar fuzzy graph representation of concept lattice ⋮ Bipolar fuzzy graph representation of concept lattice ⋮ Medical diagnoses using three-way fuzzy concept lattice and their Euclidean distance ⋮ Vague concept lattice reduction using granular computing and vague entropy ⋮ Characterising \((k,\ell )\)-leaf powers ⋮ Generalized domination in closure systems ⋮ Fuzzy graph representation of a fuzzy concept lattice ⋮ Describing hierarchy of concept lattice by using matrix ⋮ Rough Fuzzy Concept Lattice and Its Properties ⋮ Morphological Links Between Formal Concepts and Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Halin-lattices in graphs
• On rigid circuit graphs
• Decomposition by clique separators
• Efficient enumeration of all minimal separators in a graph
• Separability generalizes Dirac's theorem
• Parallel data mining for association rules on shared-memory systems
• A fast algorithm for building lattices
• Triangulating graphs without asteroidal triples
• Optimal decomposition by clique separators
• Über trennende Eckenmengen in Graphen und den Mengerschen Satz
• Schnittverbände in Graphen. (Intersection lattices in graphs)
• Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
• Representation of a finite graph by a set of intervals on the real line
• Two Basic Algorithms in Concept Analysis
• Weak Separation Lattices of Graphs
• Treillis de Séparation des Graphes
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Listing all Minimal Separators of a Graph
• How to use the minimal separators of a graph for its chordal triangulation
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Asteroidal triples of moplexes