The Jump Number of Dags and Posets: An Introduction
From MaRDI portal
Cited in
(27)- Preemptive scheduling and antichain polyhedra
- Jump number problem: The role of matroids
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- An algorithm for minimizing setups in precedence constrained scheduling
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- On finding the jump number of a partial order by substitution decomposition
- N-free posets as generalizations of series-parallel posets
- Maximum and minimum jump number of posets from matrices
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
- Alternating cycle-free matchings
- On the poset of all posets on n elements
- Algorithmic characterizations of interval orderd hypergraphs and applications
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays
- Cross-series-parallel digraphs
- Greedy balanced pairs in \(N\)-free ordered sets
- Generating linear extensions of posets by transpositions
- Fast Detection of Stable and Count Predicates in Parallel Computations
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Optimal Linear Extensions by Interchanging Chains
- Minimizing Setups for Cycle-Free Ordered Sets
- On the Jump Number of Lexicographic Sums of Ordered Sets
- Minimizing the sum cost in linear extensions of a poset
- Jump number of dags having Dilworth number 2
- On the size of jump-critical ordered sets
- The jump number and the lattice of maximal antichains
This page was built for publication: The Jump Number of Dags and Posets: An Introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3889080)
