Please use this identifier to cite or link to this item:
Title: The complexity of path coloring and call scheduling
Authors: Erlebach, T
Jansen, K
Erlebach, T
First Published: 2001
Citation: THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2), pp. 33-50
DOI Link: 10.1016/S0304-3975(99)00152-8
ISSN: 0304-3975
Type: Journal Article
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
There are no files associated with this item.

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.