2026-07-21T19:38:33Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9956 2024-03-06T10:45:12Z ddc:004 open_access

Efficient Enumeration of Dominating Sets for Sparse Graphs Kurita, Kazuhiro Wasa, Kunihiro Arimura, Hiroki Uno, Takeaki Enumeration algorithm polynomial amortized time dominating set girth degeneracy A dominating set D of a graph G is a set of vertices such that any vertex in G is in D or its neighbor is in D. Enumeration of minimal dominating sets in a graph is one of central problems in enumeration study since enumeration of minimal dominating sets corresponds to enumeration of minimal hypergraph transversal. However, enumeration of dominating sets including non-minimal ones has not been received much attention. In this paper, we address enumeration problems for dominating sets from sparse graphs which are degenerate graphs and graphs with large girth, and we propose two algorithms for solving the problems. The first algorithm enumerates all the dominating sets for a k-degenerate graph in O(k) time per solution using O(n + m) space, where n and m are respectively the number of vertices and edges in an input graph. That is, the algorithm is optimal for graphs with constant degeneracy such as trees, planar graphs, H-minor free graphs with some fixed H. The second algorithm enumerates all the dominating sets in constant time per solution for input graphs with girth at least nine. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kazuhiro Kurita and Kunihiro Wasa and Hiroki Arimura and Takeaki Uno 2018 Is Part Of LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2018.8 urn:nbn:de:0030-drops-99560 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.8 eng https://creativecommons.org/licenses/by/3.0/legalcode