Graph endpoint coloring and distributed processing
D. de Werra, Pavol Hell, Tsunehiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita · Networks · 1993
Abstract A graph‐theoretical model is presented for scheduling the transmission of messages in a computer network. A related wiring problem is also discussed; connections with classical edge colorings are exhibited and optimality properties are discussed. © 1993 by John Wiley & Sons, Inc.