An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs.
Debashis BeraMadhumangal PalTapan Kumar PalPublished in: Theory Comput. Syst. (2003)
Keyphrases
- optimization algorithm
- detection algorithm
- preprocessing
- expectation maximization
- weighted graph
- dynamic programming
- k means
- learning algorithm
- cost function
- np hard
- computational cost
- worst case
- computationally efficient
- convex hull
- particle swarm optimization
- graph matching
- maximum cardinality
- finding the shortest path
- matching algorithm
- segmentation algorithm
- search space
- optimal solution
- similarity measure