Skip navigation
Skip navigation

Deterministic Gossiping with a Periodic Protocol

Mou, Shaoshuai; Yu, Changbin (Brad); Anderson, Brian; Morse, A Stephen


A sequence of allowable gossips between pairs of agents in a group is complete if the gossip graph which the sequence generates is a connected spanning subgraph of the graph of all allowable gossip pairs; such a sequence is minimally complete if there is

CollectionsANU Research Publications
Date published: 2010
Type: Conference paper
Source: IEEE Conference on Decision and Control 2010 Proceedings
DOI: 10.1109/CDC.2010.5718066


File Description SizeFormat Image
01_Mou_Deterministic_Gossiping_with_a_2010.pdf109.58 kBAdobe PDF    Request a copy

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

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator