Affiliation:
1. Universität Tübingen, Tübingen, Germany
2. University of Newcastle, Callaghan, Australia
Abstract
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that Dominating Set restricted to planar graphs has a so-called problem kernel of linear size, achieved by two simple and easy-to-implement reduction rules. Moreover, having implemented our reduction rules, first experiments indicate the impressive practical potential of these rules. Thus, this work seems to open up a new and prospective way how to cope with one of the most important problems in graph theory and combinatorial optimization.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
173 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Dynamic treewidth;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Methodology for Reducing the Connection Possibilities in Transmission Network Expansion Planning;2023 15th Seminar on Power Electronics and Control (SEPOC);2023-10-22
3. Relaxed Connected Dominating Set Problem for Power System Cyber–Physical Security;IEEE Transactions on Control of Network Systems;2022-12
4. The fullerene graphs with a perfect star packing;Ars Mathematica Contemporanea;2022-09-29
5. Twin-width and Polynomial Kernels;Algorithmica;2022-04-19