scientific article; zbMATH DE number 6157242
From MaRDI portal
Publication:4918389
zbMath1261.06002MaRDI QIDQ4918389
Vincent Bouchitte, Michel A. Habib
Publication date: 24 April 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (14)
Computing the jump number on semi-orders is polynomial ⋮ Edge subdivision and dimension ⋮ Minimizing bumps in ordered sets by substitution decomposition ⋮ On-line computations of the ideal lattice of posets ⋮ Weak-order extensions of an order. ⋮ Synchronous, asynchronous, and causally ordered communication ⋮ Cycle-free partial orders and chordal comparability graphs ⋮ Tackling the jump number of interval orders ⋮ On the Power of Graph Searching for Cocomparability Graphs ⋮ The dimension of cycle-free orders ⋮ The connection between the bump number problem and flow-shop scheduling with precedence constraints ⋮ Computing the dimension of N-free ordered sets is NP-complete ⋮ Towards the reconstruction of posets ⋮ The jump number and the lattice of maximal antichains
This page was built for publication:
