A linear algorithm for secure domination in trees.
Alewyn P. BurgerAnton Pierre de VilliersJan H. van VuurenPublished in: Discret. Appl. Math. (2014)
Keyphrases
- learning algorithm
- times faster
- experimental evaluation
- preprocessing
- linear complexity
- improved algorithm
- search space
- computational cost
- tree structure
- significant improvement
- computational complexity
- recognition algorithm
- similarity measure
- matching algorithm
- probabilistic model
- detection algorithm
- simulated annealing
- worst case
- dynamic programming
- cost function
- k means
- high accuracy
- access control
- theoretical analysis
- optimization algorithm
- optimal solution
- objective function
- decision trees
- classification trees
- binary tree
- feature selection