Pages that link to "Item:Q3665161"
From MaRDI portal
The following pages link to Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161):
Displaying 16 items.
- The jump number of suborders of the power set order (Q583248) (← links)
- The jump number and the lattice of maximal antichains (Q807648) (← links)
- Random graph orders (Q911622) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← 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)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- Tackling the jump number of interval orders (Q1182058) (← links)
- The communication complexity of interval orders (Q1201817) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- Optimal Linear Extensions by Interchanging Chains (Q3674720) (← links)
