A simple optimal algorithm for k-tuple dominating problem in interval graphs

Peng Li (), Aifa Wang () and Jianhui Shang ()
Additional contact information
Peng Li: Chongqing University of Technology
Aifa Wang: Chongqing University of Technology
Jianhui Shang: Shanghai Jiao Tong University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 6, 9 pages

Abstract: Abstract In this paper, we study the k-tuple domination in interval graphs from an algorithmic point of view. We present a linear time algorithm to solve the k-tuple domination problem in interval graphs for any positive integer k. Surprisingly, the time complexity of our algorithm is not related to k. This generalizes and extends the results of Pramanik et al. (Int J Comb 2011:14, 2011).

Keywords: Domination; k-tuple domination; Total k-domination; k-domination; Linear time algorithm; Interval graph (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00932-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00932-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00932-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().