Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
Information Processing Letters
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Approximation algorithms for broadcasting and gossiping
Journal of Parallel and Distributed Computing
Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The complexity of broadcasting in planar and decomposable graphs
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
Rapid rumor ramification: approximating the minimum broadcast time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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 broadcast time of any vertex in an arbitrary graph is NP-complete. The polynomial time solvability is shown only for trees and unicyclic graphs. In this paper we consider necklace graphs. We present a linear algorithm to find the broadcast time of an arbitrary necklace graph.