Optimal broadcasting in the back to back d-ary trees

DOI10.1016/0020-0190(96)00071-3zbMath0900.68009OpenAlexW1975000451WikidataQ126743471 ScholiaQ126743471MaRDI QIDQ671386

Dominique Barith

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00071-3

zbMATH Keywords

GraphsBack to back d-ary treeBroadcastingComputer architectures

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Methods and problems of communication in usual networks
• Periodic gossiping in back-to-back trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal broadcasting in the back to back d-ary trees