A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems.
Ahmed YounesPublished in: CoRR (2015)
Keyphrases
- polynomial time complexity
- np complete
- computational complexity
- graph based algorithm
- learning algorithm
- cost function
- particle swarm optimization
- dominating set
- special case
- worst case
- benchmark problems
- detection algorithm
- optimal solution
- maximum flow
- graph structure
- k means
- dynamic programming
- graph isomorphism
- np hard
- shortest path problem
- minimum spanning tree
- iterative algorithms
- approximation ratio
- search algorithm
- linear programming
- min sum
- np hardness
- linear programming problems
- weighted graph
- probabilistic model
- optimization problems
- convergence rate
- connected components
- tree structure