Periodic gossiping on trees
From MaRDI portal
Publication:1339893
DOI10.1016/0166-218X(94)90187-2zbMath0836.68085OpenAlexW2079904907WikidataQ127190091 ScholiaQ127190091MaRDI QIDQ1339893
Roger Labahn, Renu C. Laskar, Stephen T. Hedetniemi
Publication date: 11 April 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(94)90187-2
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15)
Related Items
Effective systolic algorithms for gossiping in cycles and two-dimensional grids, Periodic gossiping in back-to-back trees, The complexity of systolic dissemination of information in interconnection networks, Lower bounds on systolic gossip