An efficient algorithm to generate all maximal independent sets on trapezoid graphs.
Mrinmoy HotaMadhumangal PalTapan Kumar PalPublished in: Int. J. Comput. Math. (1999)
Keyphrases
- cost function
- detection algorithm
- improved algorithm
- learning algorithm
- dynamic programming
- recognition algorithm
- computational complexity
- preprocessing
- k means
- significant improvement
- experimental evaluation
- computational cost
- tree structure
- optimization algorithm
- linear programming
- np hard
- optimal solution
- neural network
- graph structure
- convergence rate
- matching algorithm
- undirected graph
- graph search
- segmentation algorithm
- computationally efficient
- expectation maximization
- probabilistic model
- evolutionary algorithm
- objective function
- similarity measure