An Algorithm for Finding Large Induced Planar Subgraphs.
Keith EdwardsGraham FarrPublished in: Graph Drawing (2001)
Keyphrases
- dynamic programming
- k means
- experimental evaluation
- improved algorithm
- matching algorithm
- preprocessing
- optimal solution
- search space
- detection algorithm
- optimization algorithm
- computational cost
- computational complexity
- np hard
- cost function
- data sets
- high accuracy
- simulated annealing
- expectation maximization
- segmentation algorithm
- multi objective
- times faster
- significant improvement
- theoretical analysis
- tree structure
- data structure