The complexity of scheduling graphs of bounded width subject to non-zero communication delays

DSpace/Manakin Repository

The complexity of scheduling graphs of bounded width subject to non-zero communication delays
 
Verriet, J.H.
(1997) Utrecht University Repository
(Report)
Download/Full Text
Open Access version via Utrecht University Repository Unknown
 
Keywords: Wiskunde en Informatica (WIIN), Ordered by external client
ISBN: 0924-3275
Publisher: Utrecht University: Information and Computing Sciences
 
See more statistics about this item