Deterministic Gossiping with a Periodic Protocol
Mou, Shaoshuai; Yu, Changbin (Brad); Anderson, Brian; Morse, A Stephen
Description
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
| Collections | ANU Research Publications |
|---|---|
| Date published: | 2010 |
| Type: | Conference paper |
| URI: | http://hdl.handle.net/1885/59640 |
| Source: | IEEE Conference on Decision and Control 2010 Proceedings |
| DOI: | 10.1109/CDC.2010.5718066 |
Download
| File | Description | Size | Format | Image |
|---|---|---|---|---|
| 01_Mou_Deterministic_Gossiping_with_a_2010.pdf | 109.58 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 20 July 2017/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator
+61 2 6125 5111
The Australian National University, Canberra
CRICOS Provider : 00120C
ABN : 52 234 063 906
