A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
From MaRDI portal
Publication:2102897
DOI10.1007/s10878-022-00932-4OpenAlexW4309699545MaRDI QIDQ2102897
Peng Li, Aifa Wang, Jianhui Shang
Publication date: 12 December 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00932-4
linear time algorithmdominationinterval graph\(k\)-tuple domination\(k\)-dominationtotal \(k\)-domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph classes with structured neighborhoods and algorithmic applications
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- On the algorithmic complexity of \(k\)-tuple total domination
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Minimum 2-tuple dominating set of an interval graph
- \(k\)-tuple total domination in graphs
- A unified approach to domination problems on interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- A width parameter useful for chordal and co-comparability graphs
- Algorithmic graph theory and perfect graphs
- On the approximability and exact algorithms for vector domination and related problems in graphs
- The longest cycle problem is polynomial on interval graphs
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Optimal greedy algorithms for indifference graphs
- On \(k\)-domination and \(j\)-independence in graphs
- Algorithmic aspects of the \(k\)-domination problem in graphs
- Minimum 2-tuple dominating set of permutation graphs
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs
- The LBFS Structure and Recognition of Interval Graphs
- Onk-domination and minimum degree in graphs
- Trees with equal 2-domination and 2-independence numbers
- On the total k-domination number of graphs
This page was built for publication: A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
