Constructing greedy linear extensions by interchanging chains
From MaRDI portal
Publication:1087566
DOI10.1007/BF00390102zbMath0611.06003MaRDI QIDQ1087566
Publication date: 1986
Published in: Order (Search for Journal in Brave)
06A06: Partial orders, general
Related Items
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, On minimizing jumps for ordered sets, The jump number of Z-free ordered sets, On the poset of all posets on \(n\) elements, Greedy linear extensions with constraints, Obituary: Ivan Rival
Cites Work