暂无分享,去创建一个
Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes, where each call requires a unit of time and a call can involve only two nodes. We show that for bounded-degree networks determining the minimum broadcast time from an originating node remains NP-complete.
[1] Michael R. Fellows,et al. Algebraic Constructions of Efficient Broadcast Networks , 1991, AAECC.
[2] Arthur L. Liestman,et al. Broadcast Networks of Bounded Degree , 1988, SIAM J. Discret. Math..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Arthur M. Farley,et al. Minimum broadcast graphs , 1979, Discret. Math..
[5] Arthur L. Liestman,et al. Broadcasting in Bounded Degree Graphs , 1992, SIAM J. Discret. Math..