On the size of jump-critical ordered sets
From MaRDI portal
Publication:802585
DOI10.1007/BF00396268zbMath0559.06004WikidataQ71385563 ScholiaQ71385563MaRDI QIDQ802585
Mohamed H. El-Zahar, James H. Schmerl
Publication date: 1984
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00396268
68Q25: Analysis of algorithms and problem complexity
06A06: Partial orders, general
05A20: Combinatorial inequalities
Related Items
On the Jump Number of Lexicographic Sums of Ordered Sets, Jump number problem: The role of matroids, Greedy linear extensions to minimize jumps, Minimizing bumps in linear extensions of ordered sets, NP-completeness results concerning greedy and super greedy linear extensions, Greedy posets for the bump-minimizing problem, Substitution and atomic extension on greedy posets, On the poset of all posets on \(n\) elements, An improved algorithm for the jump number problem, FPT Suspects and Tough Customers: Open Problems of Downey and Fellows, Examples of Jump-Critical Ordered Sets
Cites Work