Exact Algorithm for the Maximum Induced Planar Subgraph Problem.
Fedor V. FominIoan TodincaYngve VillangerPublished in: ESA (2011)
Keyphrases
- np hard
- detection algorithm
- learning algorithm
- preprocessing
- dynamic programming
- optimal solution
- cost function
- high accuracy
- optimization algorithm
- segmentation algorithm
- times faster
- experimental evaluation
- k means
- computational complexity
- computational cost
- simulated annealing
- linear programming
- objective function
- recognition algorithm
- brute force
- theoretical analysis
- computationally efficient
- expectation maximization
- similarity measure