An algorithm to recognize weak roman domination stable trees under vertex deletion.
B. MahavirP. Roushini Leely PushpamM. KamalamPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- times faster
- detection algorithm
- dynamic programming
- learning algorithm
- high accuracy
- computational cost
- search space
- optimal solution
- minimum length
- cost function
- np hard
- experimental evaluation
- objective function
- similarity measure
- tree structure
- preprocessing
- matching algorithm
- classification algorithm
- theoretical analysis
- expectation maximization
- k means
- input data
- image segmentation
- simulated annealing
- search algorithm
- neural network
- recognition algorithm
- improved algorithm
- classification trees
- computational complexity