An algorithm for source location in directed graphs.
Mihály BárászJohanna BeckerAndrás FrankPublished in: Oper. Res. Lett. (2005)
Keyphrases
- times faster
- preprocessing
- directed graph
- improved algorithm
- clustering method
- segmentation algorithm
- theoretical analysis
- worst case
- significant improvement
- learning algorithm
- cost function
- computational cost
- high accuracy
- undirected graph
- detection algorithm
- search space
- computational complexity
- simulated annealing
- optimal solution
- shortest path problem
- maximum flow
- input data
- experimental evaluation
- dynamic programming
- objective function
- image sequences
- image segmentation