|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Derek H. Smith, Roberto Montemanni and Stephanie Perkins
Let ??=(??,??)
G
=
(
V
,
E
)
be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chuan-Min Lee
This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {??}
{
k
}
-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tapani Toivonen and Markku Tukiainen
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which?under standard assumptions in complexity theory?cannot be solved in sub-exponential time...
ver más
|
|
|
|
|
|