An algorithm for determining connectedness of tetravalent metacirculant graphs.
Ngo Dac TanTran Minh TuocPublished in: Australas. J Comb. (2005)
Keyphrases
- experimental evaluation
- detection algorithm
- computational cost
- search space
- optimal solution
- objective function
- cost function
- optimization algorithm
- significant improvement
- np hard
- dynamic programming
- probabilistic model
- improved algorithm
- computational complexity
- times faster
- computationally efficient
- expectation maximization
- simulated annealing
- similarity measure
- convergence rate
- subgraph isomorphism
- matching algorithm
- worst case
- binary images
- segmentation algorithm
- theoretical analysis
- high accuracy
- neural network
- learning algorithm