Optimal decomposition by clique separators
Discrete Mathematics
Triangulating graphs without asteroidal triples
Discrete Applied Mathematics
Efficient enumeration of all minimal separators in a graph
Theoretical Computer Science
Listing all Minimal Separators of a Graph
SIAM Journal on Computing
Separability generalizes Dirac's theorem
Discrete Applied Mathematics
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
SIAM Journal on Computing
A wide-range efficient algorithm for minimal triangulation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A fast algorithm for building lattices
Information Processing Letters
Asteroidal triples of moplexes
Discrete Applied Mathematics
Maintaining Class Membership Information
OOIS '02 Proceedings of the Workshops on Advances in Object-Oriented Information Systems
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
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Generalized domination in closure systems
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
A local approach to concept generation
Annals of Mathematics and Artificial Intelligence
Characterising (k,l)-leaf powers
Discrete Applied Mathematics
Fuzzy graph representation of a fuzzy concept lattice
Fuzzy Sets and Systems
Topological space for attributes set of a formal context
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Discrete Applied Mathematics
Multi-agents and non-classical logic systems
IUKM'11 Proceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making
Efficiently computing a linear extension of the sub-hierarchy of a concept lattice
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
A peep through the looking glass: articulation points in lattices
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On the recognition of k-equistable graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Concept lattices (also called Galois lattices) are an ordering of the maximal rectangles defined by a binary relation. In this paper, we present a new relationship between lattices and graphs: given a binary relation R, we define an underlying graph GR, and establish a one-to-one correspondence between the set of elements of the concept lattice of R and the set of minimal separators of GR. We explain how to use the properties of minimal separators to define a sublattice, decompose a binary relation, and generate the elements of the lattice.