An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs.
Sukumar MondalMadhumangal PalTapan Kumar PalPublished in: Int. J. Comput. Math. (2002)
Keyphrases
- dynamic programming
- learning algorithm
- k means
- worst case
- np hard
- optimal solution
- detection algorithm
- cost function
- globally optimal
- graph structure
- particle swarm optimization
- expectation maximization
- segmentation algorithm
- search space
- similarity measure
- experimental evaluation
- computational cost
- convergence rate
- matching algorithm
- clustering method
- optimal strategy
- adjacency graph
- undirected graph
- graph model
- obtain the optimal solution
- optimization algorithm
- simulated annealing
- high accuracy
- neural network
- probabilistic model
- image segmentation
- multi objective
- significant improvement
- objective function
- preprocessing