Edge-Labelled Gossip in RandsReport
In particular, a proper edge-coloring can be considered as a schedule for the calls of a gossiping scheme. We have investigated the time required to complete gossiping in graphs under various ooiorings. In particular, we have determined the minimum time to complete gossiping under any proper edge - coioring of a path and given bounds on the time required to Complete gossiping in cycles and in trees with bounded degree.
Note: Abstract extracted from PDF file via OCR
All rights reserved (no additional license for public reuse)
Liestman, Arthur, and Dana Richards. "Edge-Labelled Gossip in Rands." University of Virginia Dept. of Computer Science Tech Report (1989).
University of Virginia, Department of Computer Science