A simple optimal algorithm for k-tuple dominating problem in interval graphs
- 22 November 2022
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 45 (1) , 1-9
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- On the approximability and exact algorithms for vector domination and related problems in graphsDiscrete Applied Mathematics, 2013
- Minimum 2-tuple dominating set of permutation graphsJournal of Applied Mathematics and Computing, 2013
- On the total k-domination number of graphsDiscussiones Mathematicae Graph Theory, 2012
- Trees with equal 2-domination and 2-independence numbersDiscussiones Mathematicae Graph Theory, 2012
- k-tuple total domination in graphsDiscrete Applied Mathematics, 2010
- On k‐domination and minimum degree in graphsJournal of Graph Theory, 2007
- Optimal greedy algorithms for indifference graphsComputers & Mathematics with Applications, 1993
- A unified approach to domination problems on interval graphsInformation Processing Letters, 1988
- Interval graphs and interval ordersDiscrete Mathematics, 1985
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976