On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains.
Yu YangHongbo LiuHua WangAnsheng DengColton MagnantPublished in: Comput. J. (2017)
Keyphrases
- computational complexity
- computationally efficient
- computational cost
- orders of magnitude
- theoretical analysis
- recently developed
- learning algorithm
- data structure
- computationally expensive
- database
- optimization problems
- times faster
- computational efficiency
- data mining algorithms
- benchmark datasets
- semi supervised
- np hard
- relational databases
- lower bound
- data sets