Pages that link to "Item:Q3889080"
From MaRDI portal
The following pages link to The Jump Number of Dags and Posets: An Introduction (Q3889080):
Displaying 27 items.
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- On the size of jump-critical ordered sets (Q802585) (← links)
- The jump number and the lattice of maximal antichains (Q807648) (← links)
- Preemptive scheduling and antichain polyhedra (Q1003473) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Maximum and minimum jump number of posets from matrices (Q1194526) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Algorithmic characterizations of interval orderd hypergraphs and applications (Q1329816) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- Cross-series-parallel digraphs (Q1983112) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)
- Fast Detection of Stable and Count Predicates in Parallel Computations (Q3300821) (← links)
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results (Q3598041) (← links)
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161) (← links)
- Optimal Linear Extensions by Interchanging Chains (Q3674720) (← links)
- Minimizing Setups for Cycle-Free Ordered Sets (Q3960747) (← links)
- On the Jump Number of Lexicographic Sums of Ordered Sets (Q4429242) (← links)
