Searching for "The complexity of path coloring and call scheduling." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

The Complexity of Path Coloring and Call Scheduling
by Thomas Erlebach, Klaus Jansen, Corso Elvezia — 2000 — Theoretical Computer Science
…The Complexity of Path Coloring and Call Scheduling Thomas Erlebach Institut fur Informatik…
Cited by 17 (7 self) – Add To MetaCart

Scheduling Connections in Fast Networks
by Lehrstuhl Fur Effiziente Algorithmen, Thomas Erlebach — 1999
…-Transfers . . . . . . . . . . . . . . . 36 2.3.5 Multiprocessor Scheduling . . . . . . . . . . . . . . . . 37 3 Complexity of Path Coloring…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB