Pages that link to "Item:Q1092072"
From MaRDI portal
The following pages link to On finding the jump number of a partial order by substitution decomposition (Q1092072):
Displaying 9 items.
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
- The arboreal jump number of an order (Q1943701) (← links)