Item Details

Edge-Labelled Gossip in Rands

Liestman, Arthur; Richards, Dana
Format
Report
Author
Liestman, Arthur
Richards, Dana
Abstract
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
Language
English
Date Received
20121029
Published
University of Virginia, Department of Computer Science, 1989
Published Date
1989
Collection
Libra Open Repository
Logo for In CopyrightIn Copyright

Availability

Access Online