An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm.
Kazuo IwanoPublished in: Inf. Process. Lett. (1989)
Keyphrases
- learning algorithm
- computational complexity
- search space
- times faster
- optimization algorithm
- expectation maximization
- disjoint paths
- objective function
- significant improvement
- cost function
- experimental evaluation
- computational cost
- improved algorithm
- selection algorithm
- high accuracy
- optimal solution
- worst case
- np hard
- k means
- gray scale
- preprocessing
- undirected graph
- special case
- computationally efficient
- segmentation algorithm
- detection algorithm
- lower bound
- node selection
- similarity measure