An Algorithm for Finding a Minimal Equivalent Graph of a Digraph.
Harry T. HsuPublished in: J. ACM (1975)
Keyphrases
- experimental evaluation
- dynamic programming
- graph structure
- learning algorithm
- times faster
- simulated annealing
- graph based algorithm
- computational cost
- cost function
- np hard
- preprocessing
- optimization algorithm
- neural network
- maximum flow
- optimal solution
- matching algorithm
- tree structure
- clustering method
- detection algorithm
- computational complexity
- worst case
- search space
- k means
- segmentation algorithm
- probabilistic model
- convergence rate
- genetic algorithm
- weighted graph
- graph model
- strongly connected