科研成果详情

Broadcasting in networks is one of the most important information dissemination processes. It is known that finding the optimal (minimum) broadcast time is NP-hard. Some of the follow-up researches focus on approximations/heuristics to find the broadcast center, a set of nodes from which the broadcast time in the network is minimum, in a given network by assuming the problem is hard without an actual proof. In this paper, we show that answering the questions “is a set of vertices a broadcast center to the given graph”, and “does the given graph has a broadcast center of size smaller than k” are both NP-hard under Turing reductions.