Simplicial elimination schemes, extremal lattices and maximal antichain lattices

DOI10.1007/BF00389839zbMath0859.06005OpenAlexW2069446057WikidataQ40664393 ScholiaQ40664393MaRDI QIDQ1815843

Michel Morvan, Lhouari Nourine

Publication date: 7 April 1997

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00389839

zbMATH Keywords

greedy algorithmslattice of maximal antichainsextremal latticesfinite partially ordered setbipartite ordersposet of irreduciblesdistributivity checkingjump number computationlattice recognitionstrong simplicial elimination scheme

Mathematics Subject Classification ID

Partial orders, general (06A06) Parallel algorithms in computer science (68W10) Other classical set theory (including functions, relations, and set algebra) (03E20) Lattices (06B99) Distributive lattices (06D99)

Related Items (5)

Computational aspects of the 2-dimension of partially ordered sets ⋮ Tree structure for distributive lattices and its applications ⋮ Lattices, closures systems and implication bases: a survey of structural aspects and algorithms ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Towards an Iterative Classification Based on Concept Lattice

Cites Work

• A linear time and space algorithm to recognize interval orders
• The jump number and the lattice of maximal antichains
• Primes, irreducibles and extremal lattices
• Computing on-line the lattice of maximal antichains of posets
• Boolean and distributive ordered sets: Characterization and representation by sets
• The Factorization and Representation of Lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplicial elimination schemes, extremal lattices and maximal antichain lattices