Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width.
Narek BojikianStefan KratschPublished in: CoRR (2024)
Keyphrases
- experimental evaluation
- cost function
- learning algorithm
- worst case
- computational cost
- high accuracy
- preprocessing
- np hard
- dynamic programming
- improved algorithm
- matching algorithm
- optimization algorithm
- theoretical analysis
- particle swarm optimization
- k means
- computational complexity
- optimal solution
- objective function
- significant improvement
- computationally efficient
- detection algorithm
- data sets
- search space
- lower bound
- data structure
- clustering method
- ant colony optimization
- decision trees
- connected components
- neural network