The complexity of the Clar number problem and an FPT algorithm.
Erika R. Bérczi-KovácsAttila BernáthPublished in: CoRR (2015)
Keyphrases
- computational complexity
- space complexity
- cost function
- worst case
- computational cost
- polynomial time complexity
- improved algorithm
- experimental evaluation
- memory requirements
- execution times
- dynamic programming
- worst case time complexity
- times faster
- high accuracy
- recognition algorithm
- fixed parameter tractable
- expectation maximization
- matching algorithm
- segmentation algorithm
- np complete
- learning algorithm
- small number
- np hard
- preprocessing
- computationally efficient
- theoretical analysis
- detection algorithm
- simulated annealing
- multi objective
- computational effort
- k means
- search space
- linear complexity
- optimal solution
- objective function