Author:
Ambashankar Akash,Harutyunyan Hovhannes A.
Publisher
Springer Nature Switzerland
Reference20 articles.
1. Bermond, J.C.: Graceful graphs, radio antennae and French windmills. In: Proceedings One day Combinatorics Conference, Research Notes in Mathematics, vol. 34, pp. 18–37. Pitman (1979)
2. Bhabak, P., Harutyunyan, H.A., Tanna, S.: Broadcasting in Harary-like graphs. In: 2014 IEEE 17th International Conference on Computational Science and Engineering, pp. 1269–1276. IEEE (2014)
3. Čevnik, M., Žerovnik, J.: Broadcasting on cactus graphs. J. Comb. Optim. 33, 292–316 (2017)
4. Dinneen, M.J.: The complexity of broadcasting in bounded-degree networks. arXiv preprint math/9411222 (1994)
5. Elkin, M., Kortsarz, G.: Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 438–447 (2002)