The following pages link to Parallel Scheduling Algorithms (Q3959729):
Displayed 11 items.
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- On problem transformability in VLSI (Q1101222) (← links)
- An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA (Q3444840) (← links)
- Parallel computation on interval graphs: algorithms and experiments (Q4790934) (← links)
- AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER (Q4820064) (← links)
- AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗ (Q4820104) (← links)
- single Machine Preemptive Scheduling With Special Cost Functions<sup>1</sup> (Q4888275) (← links)
- On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) (← links)