A Linear-Time Algorithm for Minimum k-Hop Dominating Set of a Cactus Graph

12/10/2020
by   A. Karim Abu-Affash, et al.
0

Given a graph G=(V,E) and an integer k ≥ 1, a k-hop dominating set D of G is a subset of V, such that, for every vertex v ∈ V, there exists a node u ∈ D whose hop-distance from v is at most k. A k-hop dominating set of minimum cardinality is called a minimum k-hop dominating set. In this paper, we present linear-time algorithms that find a minimum k-hop dominating set in unicyclic and cactus graphs. To achieve this, we show that the k-dominating set problem on unicycle graph reduces to the piercing circular arcs problem, and show a linear-time algorithm for piercing sorted circular arcs, which improves the best known O(nlog n)-time algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2019

Linear algorithms on Steiner domination of trees

A set of vertices W in a connected graph G is called a Steiner dominatin...
research
08/01/2023

Minimum k-Hop Dominating Sets in Grid Graphs

Given a graph G, the k-hop dominating set problem asks for a vertex subs...
research
08/21/2020

Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem

In metric search, worst-case analysis is of little value, as the search ...
research
02/21/2022

Loop unrolling of UCA models: distance labeling

A proper circular-arc (PCA) model is a pair M = (C, A) where C is a circ...
research
08/02/2019

Independent Double Roman Domination on Block Graphs

Given a graph G=(V,E), f:V →{0,1,2 } is the Italian dominating function ...
research
09/05/2023

Run for Cover: Dominating Set via Mobile Agents

Research involving computing with mobile agents is a fast-growing field,...
research
11/08/2017

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results

The focus of this paper is two fold. Firstly, we present a logical appro...

Please sign up or login with your details

Forgot password? Click here to reset