Complexity of Domination in Triangulated Plane Graphs
D\"om\"ot\"or P\'alv\"olgyi
TL;DR
This paper proves that calculating the domination and power domination numbers in triangulated plane graphs is NP-complete, highlighting the computational difficulty of these problems in a specific class of graphs.
Contribution
The paper establishes the NP-completeness of domination and power domination problems in triangulated plane graphs, a previously unresolved complexity question.
Findings
Determined NP-completeness for domination number
Established NP-completeness for power domination number
Highlights computational challenges in specific graph classes
Abstract
We prove that for a triangulated plane graph it is NP-complete to determine its domination number and its power domination number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.