Algorithm and hardness results on neighborhood total domination in graphs.
Anupriya JhaDinabandhu PradhanS. BanerjeePublished in: Theor. Comput. Sci. (2020)
Keyphrases
- computational complexity
- computational cost
- worst case
- np hard
- times faster
- preprocessing
- expectation maximization
- experimental evaluation
- objective function
- segmentation algorithm
- simulated annealing
- significant improvement
- k means
- learning algorithm
- np complete
- optimization algorithm
- detection algorithm
- tree structure
- recognition algorithm
- clustering method
- spanning tree
- graph model
- graph mining
- randomly generated
- graph structure
- distance transform
- dynamic programming
- optimal solution
- cost function
- probabilistic model