Pages that link to "Item:Q1365936"
From MaRDI portal
The following pages link to Scheduling UET-UCT series-parallel graphs on two processors (Q1365936):
Displaying 14 items.
- A note on algebraic expressions of rhomboidal labeled graphs (Q324971) (← links)
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- Optimal scheduling for UET/UET-UCT generalized \(n\)-dimensional grid task graphs (Q1291010) (← links)
- Performance of Coffman-Graham schedules in the presence of unit communication delays (Q1382255) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- On algebraic expressions of directed grid graphs (Q1687836) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Scheduling UET-UCT outforests to minimize maximum lateness (Q1772849) (← links)
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders (Q1811068) (← links)
- Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378) (← links)
- On lengths of edge-labeled graph expressions (Q2161278) (← links)
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs (Q2357161) (← links)
- Scheduling trees with large communication delays on two identical processors (Q2464442) (← links)
- (Q4729335) (← links)
