An Algorithm for Finding the Diameter of a Graph.
W. F. SmythW. M. L. BenziPublished in: IFIP Congress (1974)
Keyphrases
- optimal solution
- preprocessing
- np hard
- dynamic programming
- learning algorithm
- objective function
- search space
- k means
- times faster
- detection algorithm
- linear programming
- method finds
- graph based algorithm
- minimum spanning tree
- recognition algorithm
- similarity measure
- computational complexity
- spanning tree
- probabilistic model
- particle swarm optimization
- worst case
- simulated annealing
- high accuracy
- experimental evaluation
- graph structure
- data points
- bayesian networks
- graph theoretical
- maximum flow
- graph databases
- weighted graph
- graph theory
- bipartite graph
- significant improvement
- matching algorithm
- tree structure
- cost function
- segmentation algorithm