|
|
|
|
|
Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo and Eleanor G. Rieffel
We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of w...
ver más
|
|
|
|
|
|
|
|
|
|
|
Geneviève Simonet and Anne Berry
The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees. A graph G is an atom graph if there is a graph whose atom g...
ver más
|
|
|
|
|
|
|
|
|
|
|
Anne Berry and Geneviève Simonet
The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aaron Barbosa, Elijah Pelofske, Georg Hahn and Hristo N. Djidjev
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of ...
ver más
|
|
|
|
|
|