A practical heuristic for finding graph minors

MaRDI QIDQ6252241zbMATH OpenFDO

Authors Jun Cai, William G. Macready, Aidan Roy

Publication date 10 June 2014

Has companion code repository https://github.com/dwavesystems/minorminer

Mathematics Subject Classification ID

Graph minors (05C83) Quantum computation (81P68)

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.

This page was built for publication: A practical heuristic for finding graph minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6252241)