A peep through the looking glass: articulation points in lattices

Authors:
Anne Berry;Alain Sigayret
Affiliations:
LIMOS UMR CNRS 6158 Ensemble Scientifique des Cézeaux, Université Blaise Pascal, Aubière, France;LIMOS UMR CNRS 6158 Ensemble Scientifique des Cézeaux, Université Blaise Pascal, Aubière, France
Venue:
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Year:
2012

Citing 6
Cited 1

Graph classes: a survey

Graph classes: a survey
How to Use the Minimal Separators of a Graph for its Chordal Triangulation

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Representing a concept lattice by a graph

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Linear-time certifying recognition algorithms and forbidden induced subgraphs

Nordic Journal of Computing
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms

Triangulation and clique separator decomposition of claw-free graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define as an 'articulation point' in a lattice an element which is comparable to all the other elements, but is not extremum. We investigate a property which holds for both the lattice of a binary relation and for the lattice of the complement relation (which we call the mirror relation): one has an articulation point if and only if the other has one also. We give efficient algorithms to generate all the articulation points. We discuss artificially creating such an articulation point by adding or removing crosses of the relation, and also creating a chain lattice. We establish the strong relationships with bipartite and co-bipartite graphs; in particular, we derive efficient algorithms to compute a minimal triangulation and a maximal sub-triangulation of a co-bipartite graph, as well as to find the clique minimal separators and the corresponding decomposition.