A new algorithm for finding vertex-disjoint paths.
Mehmet KurtMurat Ersen BerberlerOnur UgurluPublished in: Int. Arab J. Inf. Technol. (2015)
Keyphrases
- preprocessing
- dynamic programming
- computational complexity
- cost function
- detection algorithm
- probabilistic model
- computational cost
- simulated annealing
- undirected graph
- worst case
- times faster
- k means
- matching algorithm
- optimal solution
- optimization algorithm
- improved algorithm
- theoretical analysis
- np hard
- experimental evaluation
- significant improvement
- search space
- objective function
- disjoint paths
- strongly connected
- genetic algorithm
- clustering method
- computationally efficient
- expectation maximization
- linear programming
- evolutionary algorithm
- feature selection
- learning algorithm