Multi-node broadcasting in hypercubes and star graphs

Yu-Chee Tseng*

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations


In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time.

Original languageEnglish
Pages (from-to)809-820
Number of pages12
JournalJournal of Information Science and Engineering
Issue number4
StatePublished - 1 Dec 1998


  • Collective communication
  • Hypercube
  • Interconnection network
  • Many-to-all roadcasting
  • Parallel architecture
  • Routing
  • Star graph

Fingerprint Dive into the research topics of 'Multi-node broadcasting in hypercubes and star graphs'. Together they form a unique fingerprint.

  • Cite this