An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter.
Xinmin HouBolian LiuTianming WangPublished in: Graphs Comb. (2003)
Keyphrases
- detection algorithm
- computational complexity
- high accuracy
- cost function
- times faster
- dynamic programming
- experimental evaluation
- optimization algorithm
- segmentation algorithm
- computationally efficient
- learning algorithm
- matching algorithm
- k means
- search space
- preprocessing
- improved algorithm
- np hard
- recognition algorithm
- simulated annealing
- theoretical analysis
- worst case
- convergence rate
- classification algorithm
- minimum distance
- shortest path
- least squares
- state space
- computational cost
- significant improvement
- evolutionary algorithm
- optimal solution
- image segmentation