Minimizing bumps in ordered sets by substitution decomposition

DOI10.1016/0012-365X(89)90328-2MaRDI QIDQ1122595zbMATH OpenFDO

Authors 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)

Recommendations

• Minimizing bumps for posets of width two
• Minimizing bumps in linear extensions of ordered sets
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders
• Computing the bump number is easy
• Greedy linear extensions for minimizing bumps

Cites work

• scientific article; zbMATH DE number 6157242 (Why is no real title available?)
• A Fast Algorithm for the Decomposition of Graphs and Posets
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders
• Computing the bump number is easy
• Greedy posets for the bump-minimizing problem
• Minimizing bumps for posets of width two
• Minimizing bumps in linear extensions of ordered sets
• Optimal Linear Extensions by Interchanging Chains

Cited in

(7)

• Minimizing bumps in linear extensions of ordered sets
• Computing the bump number is easy
• Cross-series-parallel digraphs
• The connection between the bump number problem and flow-shop scheduling with precedence constraints
• Minimizing bumps for posets of width two
• A comparison of algorithms for minimizing bumps in linear extensions of partial orders
• scientific article; zbMATH DE number 800166 (Why is no real title available?)

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

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