Immediate Predominators in a Directed Graph [H] (Algorithm 430).
Paul Walton Purdom Jr.Edward F. MoorePublished in: Commun. ACM (1972)
Keyphrases
- shortest path problem
- directed graph
- dynamic programming
- detection algorithm
- learning algorithm
- computational complexity
- maximum flow
- k means
- cost function
- optimal solution
- matching algorithm
- particle swarm optimization
- worst case
- np hard
- optimization algorithm
- search space
- shortest path
- ant colony optimization
- objective function
- simulated annealing
- graph structure
- disjoint paths
- graphical models
- computational cost
- preprocessing
- similarity measure