A Fast and Exact Algorithm for the Median of Three Problem: A Graph Decomposition Approach.
Andrew Wei XuPublished in: J. Comput. Biol. (2009)
Keyphrases
- learning algorithm
- dynamic programming
- optimal solution
- shortest path problem
- computational complexity
- graph based algorithm
- np hard
- brute force
- worst case
- recognition algorithm
- optimization algorithm
- detection algorithm
- maximum flow
- tree decomposition
- graph structure
- directed graph
- segmentation algorithm
- particle swarm optimization
- linear programming
- computational cost
- cost function
- k means
- preprocessing
- clustering method
- convergence rate
- directed acyclic graph
- graph model
- undirected graph
- minimum spanning tree
- lower bound
- dominating set