Independent Roman Domination: The Complexity and Linear-Time Algorithm for Trees.
Zhixing DuanHuiqin JiangXinyue LiuPu WuZehui ShaoPublished in: Symmetry (2022)
Keyphrases
- worst case
- computational complexity
- space complexity
- tree structure
- optimization algorithm
- dynamic programming
- improved algorithm
- optimal solution
- computationally efficient
- experimental evaluation
- learning algorithm
- detection algorithm
- theoretical analysis
- probabilistic model
- preprocessing
- objective function
- computational cost
- high accuracy
- segmentation algorithm
- k means
- binary tree
- complexity analysis
- polynomial time complexity
- prefix tree
- data sets
- recognition algorithm
- convergence rate
- memory requirements
- times faster
- search space
- cost function
- np hard