A practical heuristic for finding graph minors

Abstract

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.

16 pages, 7 figures

Cited by in corpus (4)

• Bayesian Network Structure Learning Using Quantum Annealing
• A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
• Algorithm engineering for a quantum annealing platform
• A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting