The complexity of scheduling graphs of bounded width subject to non-zero communication delays
Publication date
1997
Authors
Verriet, J.H.
Editors
Advisors
Supervisors
DOI
Document Type
Report
Metadata
Show full item recordCollections
License
Abstract
Keywords
Wiskunde en Informatica (WIIN), Ordered by external client
Citation
Verriet, J H 1997, The complexity of scheduling graphs of bounded width subject to non-zero communication delays. vol. 1997-01, UU-CS edn, Utrecht University: Information and Computing Sciences, Utrecht, the Netherlands. < http://www.cs.uu.nl/research/techreps/UU-CS-1997-01.html >