An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs.
Keiichi KanekoNaoki SawadaPublished in: IEICE Trans. Inf. Syst. (2007)
Keyphrases
- undirected graph
- graph structure
- finding the shortest path
- dynamic programming
- directed graph
- tree structure
- optimal solution
- learning algorithm
- preprocessing
- worst case
- simulated annealing
- detection algorithm
- optimal path
- k means
- cost function
- matching algorithm
- random graphs
- search space
- disjoint paths
- computational complexity
- index structure
- expectation maximization
- probabilistic model
- np hard
- segmentation algorithm
- path length
- approximation algorithms
- complex networks
- path planning
- clustering method
- random walk
- particle swarm optimization
- objective function
- decision trees