Hardness results of connected power domination for bipartite graphs and chordal graphs
From MaRDI portal
Publication:6610089
DOI10.1142/s0129054123410071zbMATH Open1547.05222MaRDI QIDQ6610089
Publication date: 24 September 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- 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
- Some APX-completeness results for cubic graphs
- Domination in some subclasses of bipartite graphs
- Threshold graphs and related topics
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Incidence matrices and interval graphs
- Connected power domination in graphs
- Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
- A REVIEW OF TREE CONVEX SETS TEST
- Domination in Graphs Applied to Electric Power Networks
- Reducibility among Combinatorial Problems
- 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
