An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.
Colin CooperMichele ZitoPublished in: Discret. Appl. Math. (2009)
Keyphrases
- computational complexity
- experimental evaluation
- learning algorithm
- dynamic programming
- optimization algorithm
- preprocessing
- theoretical analysis
- np hard
- tree structure
- detection algorithm
- space complexity
- cost function
- computational cost
- matching algorithm
- high accuracy
- memory requirements
- times faster
- square error
- expectation maximization
- particle swarm optimization
- worst case
- k means
- decision trees
- segmentation algorithm
- clustering method
- probabilistic model
- significant improvement
- improved algorithm
- randomly generated
- recursive algorithm
- compact representations
- scales linearly
- neural network