Publication:4918389
From MaRDI portal
zbMath1261.06002MaRDI QIDQ4918389
Michel A. Habib, Vincent Bouchitte
Publication date: 24 April 2013
06A06: Partial orders, general
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On-line computations of the ideal lattice of posets, The connection between the bump number problem and flow-shop scheduling with precedence constraints, The jump number and the lattice of maximal antichains, Edge subdivision and dimension, Minimizing bumps in ordered sets by substitution decomposition, Cycle-free partial orders and chordal comparability graphs, Tackling the jump number of interval orders, Computing the jump number on semi-orders is polynomial, Weak-order extensions of an order., The dimension of cycle-free orders, Computing the dimension of N-free ordered sets is NP-complete, Towards the reconstruction of posets