Representing a concept lattice by a graph
type: Item
instance of: scholarly article
title: Representing a concept lattice by a graph
zbMATH Open document ID: 1052.06006
author: Anne Berry
author: Alain Sigayret
published in: Discrete Applied Mathematics
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 06B99
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 2115221
zbMATH Keywords: Concept lattice
zbMATH Keywords: Galois lattice
zbMATH Keywords: Co-bipartite graph
zbMATH Keywords: Minimal separator
MaRDI profile type: Publication
full work available at URL: j.dam.2004.02.016
OpenAlex ID: W2150965716
cites work: Q5685119
cites work: Q4252378
cites work: Separability generalizes Dirac's theorem
cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
cites work: Asteroidal triples of moplexes
cites work: Q4709056
cites work: Q5532570
cites work: Q3029054
cites work: On rigid circuit graphs
cites work: Schnittverbände in Graphen. (Intersection lattices in graphs)
cites work: Two Basic Algorithms in Concept Analysis
cites work: Q4230685
cites work: Q3328583
cites work: On Halin-lattices in graphs
cites work: Über trennende Eckenmengen in Graphen und den Mengerschen Satz
cites work: Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
cites work: Galois lattice as a framework to specify building class hierarchies algorithms
cites work: Listing all Minimal Separators of a Graph
cites work: Optimal decomposition by clique separators
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Triangulating graphs without asteroidal triples
cites work: A fast algorithm for building lattices
cites work: How to use the minimal separators of a graph for its chordal triangulation
cites work: Treillis de Séparation des Graphes
cites work: Q5588432
cites work: Weak Separation Lattices of Graphs
cites work: Q4501593
cites work: Efficient enumeration of all minimal separators in a graph
cites work: Decomposition by clique separators
cites work: Parallel data mining for association rules on shared-memory systems
DOI: 10.1016/J.DAM.2004.02.016
description: scientific article; zbMATH DE number 2115221