Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs

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]

Abstract

Abstract is missing.