An optimal algorithm to find minimum k-hop dominating set of interval graphs.
Sambhu Charan BarmanMadhumangal PalSukumar MondalPublished in: Discret. Math. Algorithms Appl. (2019)
Keyphrases
- dominating set
- dynamic programming
- connected dominating set
- worst case
- optimal solution
- np hard
- computational complexity
- facility location problem
- mathematical model
- spanning tree
- combinatorial optimization
- matching algorithm
- k means
- search space
- learning algorithm
- neural network
- linear programming
- undirected graph
- random graphs
- minimum length