A practical heuristic for finding graph minors
Quantum Physics
2014-06-12 v1 Data Structures and Algorithms
Combinatorics
Abstract
We present a heuristic algorithm for finding a graph as a minor of a graph that is practical for sparse and with hundreds of vertices. We also explain the practical importance of finding graph minors in mapping quadratic pseudo-boolean optimization problems onto an adiabatic quantum annealer.
Cite
@article{arxiv.1406.2741,
title = {A practical heuristic for finding graph minors},
author = {Jun Cai and William G. Macready and Aidan Roy},
journal= {arXiv preprint arXiv:1406.2741},
year = {2014}
}
Comments
16 pages, 7 figures