Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0928.06004
Ganter, Bernhard; Kuznetsov, Sergei O.
Stepwise construction of the Dedekind-MacNeille completion. (English)
[A] Mugnier, Marie-Laure (ed.) et al., Conceptual structures: theory, tools and applications. 6th international conference, ICCS '98, Montpellier, France, August 10--12, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1453, 295-302 (1998). ISBN 3-540-64791-0

The authors deal with the problem of incremental construction of lattices. They show that, with a rather general approach, this problem becomes well structured. They give a simple algorithm that, given a finite ordered set $(P,\le)$ and its completion $(L,\le)$, constructs the completion of any one-element extension of $(P,\le)$ in $O(| L|\cdot| P|\cdot\omega(P))$ steps, where $\omega(P)$ denotes the width of $(P,\le)$. They obtain that the complexity of inserting an element into a lattice $(L,\le)$ and then forming its completion is bounded by $O(| L|^2\cdot\omega(L))$.
[R.Majovská (Horni-Sucha)]

MSC 2000:: *06B23 Complete lattices
06A07 Combinatorics of partially ordered sets
68Q25 Analysis of algorithms and problem complexity

Keywords: concept lattice; preconcept; incremental construction of lattices; algorithm; finite ordered set; one-element extension; complexity of inserting an element

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]