A linear-time algorithm for minimum k-hop dominating set of a cactus graph

A. Karim Abu-Affash, Paz Carmi, Adi Krasin

Research output: Contribution to journalArticlepeer-review

Abstract

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 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 a linear-time algorithm that finds a minimum k-hop dominating set in cactus graphs, which improves the O(n3)-time algorithm of Borradaile and Le (2017). To achieve this, we show that the k-hop dominating set problem for unicyclic graphs reduces to the piercing circular arcs problem, and show a linear-time algorithm for piercing sorted circular arcs, which improves the best known O(nlogn)-time algorithm.

Original languageEnglish
Pages (from-to)488-499
Number of pages12
JournalDiscrete Applied Mathematics
Volume320
DOIs
StatePublished - 30 Oct 2022

Keywords

  • Cactus graph
  • Dominating set
  • Piercing circular arcs
  • Unicyclic graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A linear-time algorithm for minimum k-hop dominating set of a cactus graph'. Together they form a unique fingerprint.

Cite this