Hardness results of connected power domination for bipartite graphs and chordal graphs

DOI10.1007/978-3-030-92681-6_51OpenAlexW4206330506MaRDI QIDQ2150586

Pooja Goyal, B. S. Panda

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_51

zbMATH Keywords

graph algorithm\textsf{NP}-completeconnected power domination

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bandwidth of chain graphs
• Parameterized power domination complexity
• Improved algorithms and complexity results for power domination in graphs
• Threshold graphs and related topics
• Incidence matrices and interval graphs
• Connected power domination in graphs
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• Domination in Graphs Applied to Electric Power Networks
• Analytical approach to parallel repetition
• Node-and edge-deletion NP-complete problems
• Algorithms and Computation
• Computing and Combinatorics

This page was built for publication: Hardness results of connected power domination for bipartite graphs and chordal graphs