Partitioning posets

DOI10.1007/s11083-008-9085-5zbMath1151.06002OpenAlexW3189210424MaRDI QIDQ943378

Viresh Patel

Publication date: 9 September 2008

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-008-9085-5

zbMATH Keywords

PartitionsPosetsCuts

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Related Items

Average relational distance in linear extensions of posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of the existence of k-saturated partitions of partially ordered sets
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization.
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Some Extremal Properties of Bipartite Subgraphs