A polynomial algorithm for cyclic edge connectivity of cubic graphs.
Dingjun LouLihua TengXiangjun WuPublished in: Australas. J Comb. (2001)
Keyphrases
- optimization algorithm
- objective function
- computational complexity
- dynamic programming
- detection algorithm
- undirected graph
- cost function
- recognition algorithm
- expectation maximization
- optimal solution
- adjacency graph
- minimum spanning tree
- simulated annealing
- computational cost
- significant improvement
- k means
- preprocessing
- particle swarm optimization
- edge detection
- probabilistic model
- clustering method
- weighted graph
- graph theoretic
- edge detection algorithm
- hyper graph
- graph connectivity