scientific article
From MaRDI portal
Publication:3676161
zbMath0563.05029MaRDI QIDQ3676161
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Directed graphs (digraphs), tournaments (05C20)
Related Items (14)
Alternating cycle-free matchings ⋮ Computing the jump number on semi-orders is polynomial ⋮ On some complexity properties of N-free posets and posets with bounded decomposition diameter ⋮ Generating linear extensions of posets by transpositions ⋮ Greedy posets for the bump-minimizing problem ⋮ The jump number problem on interval orders: A 3/2 approximation algorithm ⋮ Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II ⋮ An algorithm for solving the jump number problem ⋮ Parallel \(N\)-free order recognition ⋮ The arboreal jump number of an order ⋮ Height counting of unlabeled interval and \(N\)-free posets. ⋮ Minimizing setups in ordered sets of fixed width ⋮ Review of properties of different precedence graphs for scheduling problems ⋮ Examples of Jump-Critical Ordered Sets
This page was built for publication:
