An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs.
Mehmet Hakan KaraataPublished in: J. Comput. Inf. Technol. (2019)
Keyphrases
- learning algorithm
- dynamic programming
- k means
- tree structure
- undirected graph
- graph structure
- preprocessing
- cost function
- np hard
- detection algorithm
- probabilistic model
- directed graph
- matching algorithm
- clustering method
- simulated annealing
- computational complexity
- genetic algorithm
- special case
- evolutionary algorithm
- search space
- graph theory
- similarity measure
- optimal path
- finding the shortest path