The complexity of broadcasting in bounded-degree networks
<|reference_start|>The complexity of broadcasting in bounded-degree networks: 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.<|reference_end|>
@article{dinneen1994the,
    title={The complexity of broadcasting in bounded-degree networks},
    author={Michael J. Dinneen},
    journal={arXiv preprint arXiv:math/9411222},
    year={1994},
    number={LACES 68Q-94-31},
    archivePrefix={arXiv},
    eprint={math/9411222},
    primaryClass={math.CO cs.CC}
}