Algorithm and hardness results on neighborhood total domination in graphs.
Anupriya JhaDinabandhu PradhanS. BanerjeePublished in: CoRR (2019)
Keyphrases
- computational complexity
- worst case
- recognition algorithm
- segmentation algorithm
- experimental evaluation
- preprocessing
- np hard
- cost function
- significant improvement
- detection algorithm
- dynamic programming
- times faster
- optimal solution
- high accuracy
- randomly generated
- graph model
- optimization algorithm
- minimum spanning tree
- linear programming
- simulated annealing
- learning algorithm
- search space
- search algorithm
- image sequences
- expectation maximization
- shortest path
- tree structure
- matching algorithm
- lower bound
- graph structure
- objective function
- similarity measure