Minimizing bumps in ordered sets by substitution decomposition

DOI10.1016/0012-365X(89)90328-2zbMath0676.06002MaRDI QIDQ1122595

George Steiner

Publication date: 1989

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

zbMATH Keywords

linear extensionautonomous subsetminimal number of bumps

Mathematics Subject Classification ID

Partial orders, general (06A06) Total orders (06A05)

Related Items

Computing the bump number is easy ⋮ Cross-series-parallel digraphs ⋮ The connection between the bump number problem and flow-shop scheduling with precedence constraints

Cites Work

• Unnamed Item
• Minimizing bumps in linear extensions of ordered sets
• Greedy posets for the bump-minimizing problem
• Computing the bump number is easy
• Minimizing bumps for posets of width two
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders
• A Fast Algorithm for the Decomposition of Graphs and Posets
• Optimal Linear Extensions by Interchanging Chains

This page was built for publication: Minimizing bumps in ordered sets by substitution decomposition