An efficient algorithm to recognize locally equivalent graphs.
André BouchetPublished in: Comb. (1991)
Keyphrases
- improved algorithm
- preprocessing
- cost function
- learning algorithm
- experimental evaluation
- computational complexity
- graph isomorphism
- segmentation algorithm
- computationally efficient
- expectation maximization
- dynamic programming
- np hard
- objective function
- computational cost
- k means
- optimal solution
- bayesian networks
- high accuracy
- particle swarm optimization
- adjacency graph
- theoretical analysis
- recognition algorithm
- detection algorithm
- spanning tree
- probabilistic model
- graph matching
- matching algorithm
- optimization algorithm
- similarity measure
- image segmentation
- feature selection
- social networks