Quantum Algorithm for Triangle Finding in Sparse Graphs.
François Le GallShogo NakajimaPublished in: CoRR (2015)
Keyphrases
- dynamic programming
- objective function
- computational complexity
- k means
- np hard
- gaussian graphical models
- graph structure
- matching algorithm
- optimization algorithm
- expectation maximization
- simulated annealing
- worst case
- detection algorithm
- optimal solution
- random graphs
- probabilistic model
- clustering method
- computational cost
- convergence rate
- directed acyclic
- similarity measure