A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem.
Abraham P. PunnenKunhiraman NairPublished in: Inf. Process. Lett. (1994)
Keyphrases
- cost function
- learning algorithm
- objective function
- optimization algorithm
- theoretical analysis
- high accuracy
- optimal solution
- preprocessing
- improved algorithm
- computational cost
- similarity measure
- recognition algorithm
- times faster
- matching algorithm
- classification algorithm
- experimental evaluation
- dynamic programming
- search space
- simulated annealing
- particle swarm optimization
- computationally efficient
- worst case
- detection algorithm
- clustering method
- np hard
- significant improvement
- convex hull
- k means
- minimum length