Faster algorithm for pathwidth one vertex deletion.
Dekel TsurPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- learning algorithm
- times faster
- optimal solution
- detection algorithm
- computational cost
- k means
- computational complexity
- search space
- cost function
- dynamic programming
- memory efficient
- recognition algorithm
- hamiltonian cycle
- highly efficient
- matching algorithm
- classification algorithm
- optimization algorithm
- simulated annealing
- worst case
- computationally efficient
- input data
- clustering method
- high accuracy
- path planning
- experimental evaluation
- np hard
- selection algorithm
- improved algorithm
- significant improvement
- preprocessing
- data sets