Faster parameterized algorithm for pumpkin vertex deletion set.
Dekel TsurPublished in: Inf. Process. Lett. (2019)
Keyphrases
- learning algorithm
- dynamic programming
- cost function
- particle swarm optimization
- segmentation algorithm
- input data
- computational cost
- experimental evaluation
- significant improvement
- initial set
- computational complexity
- recognition algorithm
- convex hull
- times faster
- computationally efficient
- np hard
- conflict free
- nearest neighbour
- improved algorithm
- detection algorithm
- neural network
- search space
- preprocessing
- expectation maximization
- optimization algorithm
- data structure
- linear programming
- high accuracy
- worst case
- graph structure
- probability distribution
- highly efficient
- undirected graph
- probabilistic model
- packing problem
- optimal solution
- input pattern
- computationally demanding