Broadcast problem in hypercube of trees

Abstract

Broadcasting is an information dissemination problem in a connected network in which one node, called the originator, must distribute a message to all other nodes by placing a series of calls along the communication lines of the network. Every time the informed nodes aid the originator in distributing the message. Finding the broadcast time of any vertex in an arbitrary graph is NP-complete. The polynomial time solvability is shown only for certain graphs like trees, unicyclic graphs, tree of cycles, necklace graphs, fully connected trees and tree of cliques. In this paper we study the broadcast problem in a hypercube of trees for which we present a 2-approximation algorithm for any originator. We also provide a linear algorithm to find the broadcast time in hypercube of trees with one tree. © 2014 Springer International Publishing.