A faster FPT algorithm for Bipartite Contraction
Sylvain GuillemotDániel MarxPublished in: CoRR (2013)
Keyphrases
- learning algorithm
- dynamic programming
- preprocessing
- k means
- optimal solution
- improved algorithm
- experimental evaluation
- np hard
- computational complexity
- objective function
- significant improvement
- optimization algorithm
- classification algorithm
- data sets
- computational cost
- simulated annealing
- segmentation algorithm
- highly efficient
- times faster
- memory efficient
- undirected graph
- space complexity
- computationally demanding
- recognition algorithm
- convex hull
- tree structure
- clustering method
- expectation maximization
- high accuracy
- cost function