An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs.
Y. Daniel LiangChongkye RheePublished in: ACM Conference on Computer Science (1995)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- experimental evaluation
- objective function
- recognition algorithm
- detection algorithm
- optimal parameters
- tree structure
- clustering method
- similarity measure
- high accuracy
- k means
- cost function
- minimum spanning tree
- significant improvement
- preprocessing
- exhaustive search
- locally optimal
- optimal path
- computational complexity
- optimal strategy
- globally optimal
- spanning tree
- closed form
- path planning
- matching algorithm
- evolutionary algorithm
- optimization algorithm
- particle swarm optimization