Efficient Enumeration of Dominating Sets for Sparse Graphs

02/22/2018
by   Kazuhiro Kurita, et al.
0

Dominating sets are fundamental graph structures. However, enumeration of dominating sets has not received much attention. This study aims to propose two efficient enumeration algorithms for sparse graphs. The first algorithm enumerates all the dominating sets for k-degenerate graphs in O(k) time per solution using O(n + m) space. Since planar graphs have a constant degeneracy, this algorithm can enumerate all such sets for planar graphs in constant time per solution. The other algorithm enumerates all the dominating sets in constant time per solution for input graphs with a girth of at least nine.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2021

TS-Reconfiguration of Dominating Sets in circle and circular-arc graphs

We study the dominating set reconfiguration problem with the token slidi...
research
11/16/2021

Hyperbolicity Computation through Dominating Sets

Hyperbolicity is a graph parameter related to how much a graph resembles...
research
06/30/2020

Linear transformations between dominating sets in the TAR-model

Given a graph G and an integer k, a token addition and removal (TAR for ...
research
02/16/2021

Roman Domination of the Comet, Double Comet, and Comb Graphs

One of the well-known measurements of vulnerability in graph theory is d...
research
05/13/2022

Disjoint Total Dominating Sets in Near-Triangulations

We show that every simple planar near-triangulation with minimum degree ...
research
09/13/2017

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs

The Apollonian networks display the remarkable power-law and small-world...
research
11/10/2021

Heuristics for k-domination models of facility location problems in street networks

We present new greedy and beam search heuristic methods to find small-si...

Please sign up or login with your details

Forgot password? Click here to reset