A polynomial algorithm of edge-neighbor-scattering number of trees.
Yong LiuZongtian WeiJiarong ShiAnchan MaiPublished in: Appl. Math. Comput. (2016)
Keyphrases
- computational complexity
- preprocessing
- recognition algorithm
- k means
- significant improvement
- dynamic programming
- optimization algorithm
- positive integer
- learning algorithm
- times faster
- memory requirements
- cost function
- objective function
- undirected graph
- matching algorithm
- expectation maximization
- tree structure
- detection algorithm
- optimal solution
- decision trees
- segmentation algorithm
- worst case
- computational cost
- search space
- space complexity
- binary tree