A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k.
Jun LiangDingjun LouPublished in: J. Comb. Optim. (2019)
Keyphrases
- detection algorithm
- computational complexity
- cost function
- dynamic programming
- undirected graph
- search space
- matching algorithm
- preprocessing
- k means
- significant improvement
- similarity measure
- segmentation algorithm
- learning algorithm
- optimal solution
- objective function
- maximum cardinality
- polynomially bounded
- graph isomorphism
- vertex set
- randomized approximation
- polynomial size
- graph clustering
- minimum spanning tree
- convergence rate
- expectation maximization
- particle swarm optimization
- simulated annealing
- worst case