Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality
solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits …

This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding
a maximum clique in a graph, one of the most fundamental and important NP-hard …

We present a fast, parallel maximum clique algorithm for large sparse graphs that is
designed to exploit characteristics of social and information networks. The method exhibits a …

Quantum annealing has the potential to find low energy solutions of NP-hard problems that
can be expressed as quadratic unconstrained binary optimization problems. However, the …

We propose a fast, parallel maximum clique algorithm for large sparse graphs that is
designed to exploit characteristics of social and information networks. Despite clique's status …

Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are
pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a …

This paper describes a new very efficient branch-and-bound exact maximum clique
algorithm BBMCSP, designed for large and massive sparse graphs which appear frequently …

In this article, we design algorithms to protect swarm-robotics applications against sensor
denial-of-service attacks on robots. We focus on applications requiring the robots to jointly …

The League Championship Algorithm (LCA) is sport-inspired optimization algorithm that was
introduced by Ali Husseinzadeh Kashan in the year 2009. It has since drawn enormous …

To this day, the maximum clique problem remains a computationally challenging problem.
Indeed, despite researchers' best efforts, there exist unsolved benchmark instances with …