Efficient algorithms on distributive lattices

DOI10.1016/S0166-218X(00)00258-4zbMath0983.06009OpenAlexW2049890507MaRDI QIDQ5936459

Raoul Median, Lhouari Nourine, George Steiner, Michel A. Habib

Publication date: 30 January 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00258-4

zbMATH Keywords

posetcovering relationideal latticeideal treelinear time algorithmlist of all order ideals

Mathematics Subject Classification ID

Partial orders, general (06A06) Nonnumerical algorithms (68W05) Structure and representation theory of distributive lattices (06D05) Combinatorial codes (94B25)

Related Items (11)

Central Positions in Social Networks ⋮ On the random generation and counting of weak order extensions of a poset with given class cardinalities ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Enumerating \(k\)-arc-connected orientations ⋮ On random generation of fuzzy measures ⋮ The stable marriage problem with restricted pairs. ⋮ An optimal algorithm to generate tilings ⋮ Counting linear extension majority cycles in partially ordered sets on up to 13 elements ⋮ A fast incremental algorithm for building lattices ⋮ Representation of lattices via set-colored posets ⋮ Skyline groups are ideals. An efficient algorithm for enumerating skyline groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to generate the ideals of a partial order
• Finding all closed sets: A general approach
• Gray codes from antimatroids
• Tree structure for distributive lattices and its applications
• A Gray Code for the Ideals of a Forest Poset
• Calcul des idéaux d'un ordonné fini
• Listing and Counting Subtrees of a Tree
• Generating Linear Extensions Fast
• Gray Codes for the Ideals of Interval Orders
• A Survey of Combinatorial Gray Codes
• Reachability analysis on distributed executions

This page was built for publication: Efficient algorithms on distributive lattices