Comparability graph augmentation for some multiprocessor scheduling problems
Dell'olmo, P. and Speranza, MG and Tuza, Zsolt (1997) Comparability graph augmentation for some multiprocessor scheduling problems. DISCRETE APPLIED MATHEMATICS, 72 (1-2). pp. 71-84.
Full text not available from this repository.Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Systems and Control Lab |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 14:53 |
Last Modified: | 11 Dec 2012 14:53 |
URI: | https://eprints.sztaki.hu/id/eprint/1502 |
Update Item |