Pages that link to "Item:Q1820992"
From MaRDI portal
The following pages link to A comparison of algorithms for minimizing bumps in linear extensions of partial orders (Q1820992):
Displaying 7 items.
- The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
- Computing the bump number is easy (Q1106863) (← links)
- Minimizing bumps for posets of width two (Q1114719) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
- Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets (Q2224808) (← links)
- (Q3985788) (← links)