Systematic and deterministic graph minor embedding for Cartesian products of graphs

This publication has 19 references indexed in Scilit:

• Fast clique minor generation in Chimera qubit connectivity graphs
  Quantum Information Processing, 2015
• Faster parameterized algorithms for minor containment
  Theoretical Computer Science, 2011
• Quantum annealing with manufactured spins
  Nature, 2011
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
  Quantum Information Processing, 2010
• Treewidth computations I. Upper bounds
  Information and Computation, 2010
• Linear and quadratic programming approaches for the general graph partitioning problem
  Journal of Global Optimization, 2010
• On tree width, bramble size, and expansion
  Journal of Combinatorial Theory, Series B, 2009
• Recognizing Cartesian products in linear time
  Discrete Mathematics, 2007
• Scalable Architecture for Adiabatic Quantum Computing of Np-Hard Problems
  2004
• Graph Partitioning and Continuous Quadratic Programming
  SIAM Journal on Discrete Mathematics, 1999