Related papers: Minor Embedding in Broken Chimera and Pegasus Grap…
A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…
This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new topology compared to the existing Chimera…
Graphs are widely used to model execution dependencies in applications. In particular, the NP-complete problem of partitioning a graph under constraints receives enormous attention by researchers because of its applicability in…
This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows…
In this paper, we study the parameterized complexity and inapproximability of the {\sc Induced Matching} problem in hamiltonian bipartite graphs. We show that, given a hamiltonian cycle in a hamiltonian bipartite graph, the problem is…
Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique…
In [Choi08], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a quantum hardware graph U is a subgraph of U such that G can be obtained from it by contracting edges. In this…
The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…
Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solving them. An approach developed in computer science for…
The Metric Embedding problem takes as input two metric spaces $(X,D_X)$ and $(Y,D_Y)$, and a positive integer $d$. The objective is to determine whether there is an embedding $F:X \rightarrow Y$ such that $d_{F} \leq d$, where $d_{F}$…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding…
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational biology, and biochemistry. We show an explicit construction…
Given a graph $ G $ with $ n $ vertices and a set $ S $ of $ n $ points in the plane, a point-set embedding of $ G $ on $ S $ is a planar drawing such that each vertex of $ G $ is mapped to a distinct point of $ S $. A straight-line…
We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem is NP-hard, even in the restricted case where C is…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives a proof that, for graphs where each…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Graphs are a representation of structured data that captures the relationships between sets of objects. With the ubiquity of available network data, there is increasing industrial and academic need to quickly analyze graphs with billions of…