On independence domination
Wing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu, Sheung-Hung Poon, and Yue-Li Wang
TL;DR
This paper studies the independence-domination number in graphs, exploring its computational complexity, providing an exact exponential algorithm, and developing a PTAS for planar graphs, advancing understanding in graph domination problems.
Contribution
It introduces new algorithms for independence domination, including an exact exponential algorithm and a PTAS for planar graphs, expanding algorithmic tools for this problem.
Findings
Exact exponential algorithm for independence domination.
PTAS for independence domination in planar graphs.
Analysis of complexity in cograph-related graph classes.
Abstract
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm. We also present a PTAS for planar graphs.
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory