Quantum and randomized lower bounds for local search on vertex-transitive graphs.
Hang T. DinhAlexander RussellPublished in: Quantum Inf. Comput. (2010)
Keyphrases
- lower bound
- directed graph
- upper bound
- undirected graph
- labeled graphs
- optimal solution
- attributed graphs
- randomized algorithms
- randomized algorithm
- search algorithm
- branch and bound
- maximum cardinality
- np hard
- objective function
- minimum weight
- search space
- minimum spanning tree
- genetic algorithm
- branch and bound algorithm
- edge weights
- lower and upper bounds
- memetic algorithm
- global search
- graph matching
- vc dimension
- hamiltonian cycle
- simulated annealing
- graph kernels
- graph databases
- weighted graph
- connected subgraphs
- random walk
- stochastic local search
- quadratic assignment problem
- graph model
- graph mining
- vertex set
- graph structure
- spanning tree
- average degree
- quantum computation