An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.
Dingjun LouWei WangPublished in: Ars Comb. (2005)
Keyphrases
- learning algorithm
- experimental evaluation
- computational complexity
- preprocessing
- detection algorithm
- matching algorithm
- recognition algorithm
- computationally efficient
- undirected graph
- dynamic programming
- np hard
- k means
- computational cost
- significant improvement
- graph connectivity
- graph construction
- weighted graph
- hyper graph
- graph structure
- neural network
- tree structure
- optimization algorithm
- expectation maximization
- high accuracy
- worst case
- cost function
- image segmentation