Periodic gossiping in back-to-back trees

DOI10.1016/S0166-218X(96)00086-8zbMath0882.90044OpenAlexW2087340206MaRDI QIDQ1363646

Roger Labahn, Andre Raspaud

Publication date: 10 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Optimal broadcasting in the back to back d-ary trees

Cites Work

• Unnamed Item
• Methods and problems of communication in usual networks
• Traffic-light scheduling on the grid
• Periodic gossiping on trees
• A survey of gossiping and broadcasting in communication networks
• The complexity of systolic dissemination of information in interconnection networks

This page was built for publication: Periodic gossiping in back-to-back trees