An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization.
Ngai-Hang Z. LeungKim-Chuan TohPublished in: SIAM J. Sci. Comput. (2009)
Keyphrases
- computational complexity
- graph based algorithm
- preprocessing
- matching algorithm
- cost function
- learning algorithm
- dynamic programming
- probabilistic model
- weighted graph
- objective function
- np hard
- worst case
- detection algorithm
- tree structure
- k means
- combinatorial optimization
- noisy data
- minimum spanning tree
- feature selection