A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs.
Jun LiangDingjun LouZongrong QinQinglin YuPublished in: J. Comb. Optim. (2019)
Keyphrases
- dynamic programming
- graph structure
- cost function
- detection algorithm
- worst case
- expectation maximization
- optimal solution
- attributed graphs
- matching algorithm
- clustering method
- hamiltonian cycle
- learning algorithm
- computational cost
- k means
- preprocessing
- simulated annealing
- polynomial size
- hyper graph
- strongly connected
- graph clustering
- graph theory
- random walk
- probabilistic model