Minimizing bumps for posets of width two

DOI10.1016/0166-218X(88)90051-0zbMath0663.06002MaRDI QIDQ1114719

Nejib Zaguia

Publication date: 1988

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

zbMATH Keywords

linear extension of a finite partially ordered setlinear extension with a minimum number of bumps

Mathematics Subject Classification ID

Partial orders, general (06A06)

Related Items (4)

Generating linear extensions of posets by transpositions ⋮ Greedy posets for the bump-minimizing problem ⋮ Computing the bump number is easy ⋮ Minimizing bumps in ordered sets by substitution decomposition

Cites Work

• Unnamed Item
• Minimizing setups in ordered sets of fixed width
• Jump number of dags having Dilworth number 2
• Minimizing bumps in linear extensions of ordered sets
• Constructing greedy linear extensions by interchanging chains
• Optimal Linear Extensions by Interchanging Chains
• Minimizing Setups for Cycle-Free Ordered Sets

This page was built for publication: Minimizing bumps for posets of width two