A Near Optimal Algorithm for Vertex Connectivity Augmentation.
Bill JacksonTibor JordánPublished in: ISAAC (2000)
Keyphrases
- cost function
- computational cost
- learning algorithm
- detection algorithm
- dynamic programming
- preprocessing
- matching algorithm
- improved algorithm
- search space
- times faster
- np hard
- computational complexity
- significant improvement
- k means
- estimation algorithm
- experimental evaluation
- selection algorithm
- high accuracy
- linear programming
- theoretical analysis
- segmentation algorithm
- undirected graph
- recognition algorithm
- attributed graphs
- path planning
- classification algorithm
- optimization algorithm
- computationally efficient
- worst case
- multi objective
- search algorithm
- objective function
- face recognition