Pooja Goyal, B. S. Panda 0001. Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. In Ding-Zhu Du, Donglei Du, Chenchen wu, Dachuan Xu, editors, Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings. Volume 13135 of Lecture Notes in Computer Science, pages 653-667, Springer, 2021. [doi]
@inproceedings{GoyalP21-2,
title = {Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs},
author = {Pooja Goyal and B. S. Panda 0001},
year = {2021},
doi = {10.1007/978-3-030-92681-6_51},
url = {https://doi.org/10.1007/978-3-030-92681-6_51},
researchr = {https://researchr.org/publication/GoyalP21-2},
cites = {0},
citedby = {0},
pages = {653-667},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings},
editor = {Ding-Zhu Du and Donglei Du and Chenchen wu and Dachuan Xu},
volume = {13135},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-92681-6},
}