Planarity Based Algorithms for Minor Embedding in Grid Graphs

Download or read book Planarity Based Algorithms for Minor Embedding in Grid Graphs written by Seyedeh Sahba Etezad and published by . This book was released on 2016 with total page 69 pages. Available in PDF, EPUB and Kindle. Book excerpt: We present heuristic algorithms for minor embedding planar graphs in grids. Our work is motivated by the development of quantum computing hardware that performs quantum annealing. This hardware can be used to solve hard combinatorial problems, but requires the graph of each problem instance to be minor embedded in a graph that models the hardware. Hence, there is a need for practical minor embedding algorithms. We restrict our attention to planar graphs, and thus are able to make use of existing graph drawing methods. We present two algorithms for minor embedding planar graphs in grid graphs, and provide an experimental evaluation of one.