Answers are grounded in this paper and cite their sources.
We present a heuristic algorithm for finding a graph H as a minor of a graph G that is practical for sparse G and H 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.
No takes yet. Share an insight, caveat, or question.
Cai et al. (2014) studied this question.