Shortest node-to-node disjoint paths algorithm for symmetric networks.
Hesham AlMansouriZaid HussainPublished in: Clust. Comput. (2024)
Keyphrases
- path length
- learning algorithm
- search space
- detection algorithm
- undirected graph
- disjoint paths
- preprocessing
- graph structure
- tree structure
- dynamic programming
- computational cost
- k means
- np hard
- optimization algorithm
- segmentation algorithm
- expectation maximization
- simulated annealing
- matching algorithm
- directed graph
- worst case
- probabilistic model
- decision trees
- genetic algorithm