Computer Sciences Dept.

NP-Completeness of Linearly-Connected Multiprocessor Scheduling

Gilbert Verghese and Charles R Dyer
1987

Download this report (PDF)


Return to tech report index

 
Computer Science | UW Home