Nov 15, 2021 · In this paper, we address enumeration problems for dominating sets from sparse graphs which are degenerate graphs and graphs with large girth.

Feb 22, 2018 · 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 ...

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 ...

Sep 29, 2018 · In this paper, we address enumeration problems for dominating sets from sparse graphs which are degenerate graphs and graphs with large girth,.

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 ...

However, enumeration of dominating sets has not received much attention. This study aims to propose two efficient enumeration algorithms for sparse graphs.

It can be enumerated in polynomial delay [7]. This study focuses on graph sparsity as being a good structural property and, in par‐ ticular, on degeneracy, ...

Algorithm 3 runs much faster for a large sparse bipartite graph, since the degree distribution is skewed, i.e., high degree vertices are not many. In summary, ...

In this paper, we are interested in the enumeration of (inclusion-wise) minimal dominating sets in graphs, called the Dom-Enum problem. It is well known ...

We find more efficient maximal independent set generation algorithms for many graph classes including bounded degree graphs, minor-closed graph families, and ...