A polynomial time algorithm for cyclic vertex connectivity of cubic graphs.
Jun LiangDingjun LouZan-Bo ZhangPublished in: Int. J. Comput. Math. (2017)
Keyphrases
- worst case
- computational complexity
- graph isomorphism
- adjacency graph
- graph model
- objective function
- preprocessing
- optimal solution
- computational cost
- undirected graph
- np complete
- matching algorithm
- detection algorithm
- polynomial time complexity
- learning algorithm
- simulated annealing
- cost function
- search space
- optimization algorithm
- boolean functions
- expectation maximization
- polynomial size
- dynamic programming