scientific article; zbMATH DE number 4200270

zbMATH Open0727.06006MaRDI QIDQ3348951FDOQ3348951

Authors: Sergey Fomin 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• An algorithmic approach to maximal unions of chains in a partially ordered set
• Algorithms over partially ordered sets
• Algorithms for dualization over products of partially ordered sets
• Some algorithms based on the dual of Dilworth's theorem
• Two easy duality theorems for product partial orders

zbMATH Keywords

recursive algorithmYoung diagramantichainsduality theoremmaximal elementschainsmaximal number of elements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07)

Cited In (9)

• Finite posets and Ferrers shapes
• An algorithmic approach to maximal unions of chains in a partially ordered set
• Algorithms for dualization over products of partially ordered sets
• Some algorithms based on the dual of Dilworth's theorem
• A note on covering Young diagrams with applications to local dimension of posets
• Research problems
• Optimization over Young diagrams
• Algorithms over partially ordered sets
• Title not available (Why is that?)

This page was built for publication:

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