An Algorithm to Generate all Topological Sorting Arrangements.
Yaakov L. VarolDoron RotemPublished in: Comput. J. (1981)
Keyphrases
- detection algorithm
- theoretical analysis
- cost function
- improved algorithm
- np hard
- experimental study
- segmentation algorithm
- computationally efficient
- computational cost
- dynamic programming
- k means
- times faster
- search space
- preprocessing
- high accuracy
- simulated annealing
- computational complexity
- optimal solution
- optimization algorithm
- generation method
- worst case
- segmentation method
- convex hull
- single pass
- data sets
- significant improvement
- search algorithm
- objective function
- multiscale
- similarity measure