An algorithmic approach to maximal unions of chains in a partially ordered set

MaRDI QIDQ3428796zbMATH OpenFDO

Authors Flavio Bonetti, Silimbani Matteo, Marilena Barnabei

Publication date 29 March 2007

zbMATH Keywords

Greene's Duality Theoremmaximal unions of chains

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)

Recommendations

• scientific article; zbMATH DE number 4200270
• Algorithms over partially ordered sets
• Some algorithms based on the dual of Dilworth's theorem
• Antichain sequences
• ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible

Cited in

(6)

• scientific article; zbMATH DE number 1935512 (Why is no real title available?)
• Two easy duality theorems for product partial orders
• Unichain coverings in partial orders with the nested saturation property
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
• Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
• Semistandard tableaux associated with generalized labellings of posets

This page was built for publication: An algorithmic approach to maximal unions of chains in a partially ordered set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428796)