Constructing greedy linear extensions by interchanging chains

DOI10.1007/BF00390102zbMath0611.06003MaRDI QIDQ1087566

Nejib Zaguia, Ivan Rival

Publication date: 1986

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

ordered setjump numbergreedy chain interchange algorithmgreedy linear extension

Mathematics Subject Classification ID

Partial orders, general (06A06)

Related Items (10)

On the poset of all posets on \(n\) elements ⋮ NP-completeness results concerning greedy and super greedy linear extensions ⋮ Greedy posets for the bump-minimizing problem ⋮ On minimizing the jump number for interval orders ⋮ Minimizing bumps for posets of width two ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ On minimizing jumps for ordered sets ⋮ The jump number of Z-free ordered sets ⋮ Greedy linear extensions with constraints ⋮ Obituary: Ivan Rival

Cites Work

• Greedy linear extensions to minimize jumps
• Optimal Linear Extensions by Interchanging Chains
• Unnamed Item

This page was built for publication: Constructing greedy linear extensions by interchanging chains