An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks.
Kazuhiko MatsumotoTakao NishizekiNobuji SaitoPublished in: SIAM J. Comput. (1985)
Keyphrases
- times faster
- detection algorithm
- learning algorithm
- k means
- recognition algorithm
- experimental evaluation
- significant improvement
- high accuracy
- computationally efficient
- dynamic programming
- np hard
- preprocessing
- computational complexity
- optimal solution
- social networks
- improved algorithm
- probabilistic model
- particle swarm optimization
- worst case
- segmentation algorithm
- cost function
- search algorithm
- combinatorial optimization
- convergence rate
- bayesian networks
- similarity measure
- network flow
- method finds