The ruzzo-tompa algorithm can find the maximal paths in weighted, directed graphs on a one-dimensional lattice.
John L. SpougeLeonardo Mariño-RamírezSergey SheetlinPublished in: ICCABS (2012)
Keyphrases
- directed graph
- detection algorithm
- maximum flow
- preprocessing
- undirected graph
- experimental evaluation
- worst case
- optimal solution
- cost function
- np hard
- computational cost
- path planning
- simulated annealing
- path finding
- optimal path
- clustering method
- optimization algorithm
- expectation maximization
- particle swarm optimization
- dynamic programming
- significant improvement
- k means
- matching algorithm
- multi dimensional
- evolutionary algorithm
- computational complexity