An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes.
Qian-Ping GuShietung PengPublished in: J. Parallel Distributed Comput. (2000)
Keyphrases
- pairwise
- dynamic programming
- optimal solution
- detection algorithm
- similarity measure
- experimental evaluation
- computational complexity
- computationally efficient
- cost function
- np hard
- expectation maximization
- probabilistic model
- optimization algorithm
- random walk
- matching algorithm
- high accuracy
- significant improvement
- k means
- times faster
- improved algorithm
- disjoint paths
- tree structure
- convex hull
- worst case
- clustering method
- segmentation algorithm
- graphical models
- neural network
- preprocessing
- objective function
- clustering algorithm