Broadcasting in Fully Connected Trees

Broadcasting is an information dissemination problem in a connected network, in which one node, called the originator, disseminates a message to all other nodes by placing a series of calls along the communication lines of the network. Once informed, the nodes aid the originator in distributing the message. Finding the minimum broadcast time of a vertex in an arbitrary graph is NP-complete. The problem is solved polynomially only for trees, unicyclic graphs, and tree of cycles. In this paper we consider broadcasting in a new class called the Fully Connected Trees (FCT). We present a O(n log n) algorithm to find the broadcast time of any originator in an arbitrary FCT.