An algorithm for the determination of longest distances in a graph.
Hartmut NoltemeierPublished in: Math. Program. (1975)
Keyphrases
- preprocessing
- significant improvement
- learning algorithm
- matching algorithm
- k means
- graph structure
- graph based algorithm
- objective function
- simulated annealing
- np hard
- dynamic programming
- worst case
- tree structure
- probabilistic model
- hamming distance
- shortest path problem
- graph search
- ant colony optimization
- detection algorithm
- optimization algorithm
- computational cost
- cost function
- search space
- computational complexity
- similarity measure