Name
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. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Complete graph,Discrete mathematics,Combinatorics,Line graph,Wagner graph,Edge contraction,Null graph,Petersen graph,Graph minor,Mathematics,Complement graph |
DocType | Volume | Citations |
Journal | abs/1406.2741 | 30 |
PageRank | References | Authors |
1.70 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Cai | 1 | 31 | 3.73 |
| William G. Macready | 2 | 161 | 39.07 |
| Aidan Roy | 3 | 72 | 4.26 |