Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.
John M. BoyerPier Francesco CorteseMaurizio PatrignaniGiuseppe Di BattistaPublished in: Graph Drawing (2003)
Keyphrases
- preprocessing
- learning algorithm
- dynamic programming
- times faster
- improved algorithm
- high accuracy
- theoretical analysis
- detection algorithm
- cost function
- optimization algorithm
- significant improvement
- experimental evaluation
- segmentation algorithm
- linear programming
- convergence rate
- probabilistic model
- computational complexity
- depth first search
- neural network
- breadth first search
- computationally efficient
- expectation maximization
- particle swarm optimization
- simulated annealing
- knn
- clustering algorithm
- feature selection