Greedy linear extensions for minimizing bumps

MaRDI QIDQ1092935zbMATH OpenFDO

Authors Nejib Zaguia, Fawzi Al-Thukair

Publication date 1987

Published in Order (Search for Journal in Brave)

zbMATH Keywords

finite posetlinear extensionjump numberoptimal linear extensionbump numbergreedy linear extensiongreedy poset

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Total orders (06A05)

Recommendations

• Greedy posets for the bump-minimizing problem
• Minimizing bumps for posets of width two
• scientific article; zbMATH DE number 221764
• Minimizing bumps in linear extensions of ordered sets
• Minimizing the maximum bump cost in linear extensions of a poset

Cited in

(8)

• Substitution and atomic extension on greedy posets
• Greedy linear extensions with constraints
• scientific article; zbMATH DE number 221764 (Why is no real title available?)
• Minimizing bumps in ordered sets by substitution decomposition
• Minimizing bumps for posets of width two
• Greedy posets for the bump-minimizing problem
• scientific article; zbMATH DE number 800166 (Why is no real title available?)
• Minimizing the maximum bump cost in linear extensions of a poset

This page was built for publication: Greedy linear extensions for minimizing bumps

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