An algorithm for the construction of the graphs of organic molecules.
Harold BrownLarry MasinterPublished in: Discret. Math. (1974)
Keyphrases
- learning algorithm
- k means
- search space
- optimization algorithm
- times faster
- computational complexity
- high accuracy
- recognition algorithm
- matching algorithm
- experimental evaluation
- dynamic programming
- np hard
- cost function
- preprocessing
- optimal solution
- graph matching
- detection algorithm
- graph structure
- improved algorithm
- image segmentation
- graph clustering
- max cut
- theoretical analysis
- expectation maximization
- particle swarm optimization
- input data
- linear programming
- simulated annealing
- computational cost
- similarity measure