An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization.
Wing Ning LiPublished in: SAC (1995)
Keyphrases
- minimum length
- optimal path
- optimization algorithm
- undirected graph
- detection algorithm
- objective function
- computational complexity
- tree structure
- constrained optimization
- convex hull
- optimization method
- segmentation algorithm
- computationally efficient
- input data
- dynamic programming
- np hard
- cost function
- learning algorithm
- optimization criteria
- decomposition algorithm
- search space
- optimization process
- input pattern
- root node
- initial set
- min sum
- node selection
- minimum cost
- knapsack problem
- image set
- directed graph
- path planning
- expectation maximization
- graphical models
- worst case
- k means
- pairwise
- optimal solution