An $$O(n+m)$$ time algorithm for computing a minimum semitotal dominating set in an interval graph.
Dinabandhu PradhanSaikat PalPublished in: J. Appl. Math. Comput. (2021)
Keyphrases
- dominating set
- facility location problem
- connected dominating set
- dynamic programming
- expectation maximization
- computational complexity
- graph structure
- particle swarm optimization
- spanning tree
- k means
- learning algorithm
- worst case
- graph model
- np hard
- random walk
- communication networks
- supply chain
- search space
- objective function
- bayesian networks
- clustering algorithm