An algorithm for disjoint paths in bubble-sort graphs.
Yasuto SuzukiKeiichi KanekoPublished in: Systems and Computers in Japan (2006)
Keyphrases
- dynamic programming
- optimal solution
- preprocessing
- objective function
- computational complexity
- search space
- segmentation algorithm
- significant improvement
- computational cost
- experimental evaluation
- graph isomorphism
- minimum spanning tree
- detection algorithm
- high accuracy
- np hard
- k means
- cost function
- state space
- worst case
- evolutionary algorithm
- similarity measure
- tree structure
- finite element
- graph structure
- undirected graph
- image segmentation
- neural network