An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem.
Jiazhen CaiXiaofeng HanRobert Endre TarjanPublished in: SIAM J. Comput. (1993)
Keyphrases
- worst case
- preprocessing
- significant improvement
- dynamic programming
- high accuracy
- optimal solution
- times faster
- search space
- matching algorithm
- cost function
- detection algorithm
- learning algorithm
- improved algorithm
- recognition algorithm
- optimization algorithm
- expectation maximization
- computational cost
- experimental evaluation
- computational complexity
- input data
- particle swarm optimization
- simulated annealing
- computationally efficient
- theoretical analysis
- segmentation algorithm
- clustering method
- multi objective
- lower bound
- weighted graph
- genetic algorithm