Efficiently computing a linear extension of the sub-hierarchy of a concept lattice

Authors:
Anne Berry;Marianne Huchard;Ross M. McConnell;Alain Sigayret;Jeremy P. Spinrad
Affiliations:
LIMOS (Laboratoire d'Informatique de Modélisation et d'Optimisation des Systèmes), CNRS UMR 6158, Université Clermont-Ferrand II, Ensemble scientifique des Cézeaux, Aub ...;LIRMM (Laboratoire d'Informatique de Robotique et de Micro-électronnique de Montpellier), CNRS UMR 5506, Université Montpellier II, Montpellier cedex 5, France;EECS Department, Vanderbilt University, Nashville, TN;LIMOS (Laboratoire d'Informatique de Modélisation et d'Optimisation des Systèmes), CNRS UMR 6158, Université Clermont-Ferrand II, Ensemble scientifique des Cézeaux, Aub ...;Computer Science Department, Colorado State University, Fort Collins, CO
Venue:
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Year:
2005

Citing 7
Cited 2

Doubly lexical ordering of dense 0–1 matrices

Information Processing Letters
Building and maintaining analysis-level class hierarchies using Galois Lattices

OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Design of class hierarchies based on concept (Galois) lattices

Theory and Practice of Object Systems - Special issue high availability in CORBA
Maintaining Class Membership Information

OOIS '02 Proceedings of the Workshops on Advances in Object-Oriented Information Systems
iO2 - An Algorithmic Method for Building Inheritance Graphs in Object Database Design

ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
A New Approach to Factorization - Introducing Metrics

METRICS '02 Proceedings of the 8th International Symposium on Software Metrics
Representing a concept lattice by a graph

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)

Hierarchical Organization of Agents Based on Galois Sub-Hierarchy for Complex Tasks Allocation in Massive MAS

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Performances of galois sub-hierarchy-building algorithms

ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Galois sub-hierarchies have been introduced as an interesting polynomial-size sub-order of a concept lattice, with useful applications. We present an algorithm which, given a context, efficiently computes an ordered partition which corresponds to a linear extension of this sub-hierarchy.