Node-Disjoint Paths Algorithm in a Transposition Graph.
Yasuto SuzukiKeiichi KanekoMario NakamoriPublished in: IEICE Trans. Inf. Syst. (2006)
Keyphrases
- graph structure
- learning algorithm
- tree structure
- search space
- dynamic programming
- undirected graph
- disjoint paths
- graph based algorithm
- detection algorithm
- preprocessing
- k means
- np hard
- worst case
- maximum flow
- graph clustering
- probabilistic model
- objective function
- graph theory
- random graphs
- computational complexity
- optimal solution