Tree structure for distributive lattices and its applications

DOI10.1016/0304-3975(95)00232-4zbMath0887.68016OpenAlexW2004706734MaRDI QIDQ1366682

Lhouari Nourine, Michel A. Habib

Publication date: 18 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00232-4

zbMATH Keywords

scheduling theoryideal treedata structure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (7)

Succinct posets ⋮ Discovering unseen behaviour from event logs ⋮ Counting and Computing Join-Endomorphisms in Lattices ⋮ Computing distributed knowledge as the greatest lower bound of knowledge ⋮ Efficient algorithms on distributive lattices ⋮ A fast incremental algorithm for building lattices ⋮ A fast algorithm for building lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Sperner theorem on unrelated chains of subsets
• An algorithm to generate the ideals of a partial order
• Primes, irreducibles and extremal lattices
• Simplicial elimination schemes, extremal lattices and maximal antichain lattices
• Fast Algorithms for Finding Nearest Common Ancestors
• GTES : une méthode de simulation par jeux et apprentissage pour l'analyse des systèmes d'acteurs
• Data Types as Lattices
• Time, clocks, and the ordering of events in a distributed system
• Gray Codes for the Ideals of Interval Orders
• The Transitive Reduction of a Directed Graph

This page was built for publication: Tree structure for distributive lattices and its applications