The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …

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 …

When searching for a maximum clique in a graph G, branch-and-bound algorithms in the
literature usually focus on the minimization of the number of branches generated at each …

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 …

The maximum clique problem is a well-known NP-hard problem with applications in data
mining, network analysis, information retrieval, and many other areas related to the World …

An algorithm is said to be certifying if it outputs, together with a solution to the problem it
solves, a proof that this solution is correct. We explain how state of the art maximum clique …

Finding the best way to map virtual machines (VMs) to physical machines (PMs) in a cloud
data center is an important optimization problem, with significant impact on costs …

Given a graph G=(V, E), the Maximum Independent Set problem (MIS) aims to determine a
subset S⊆ V of maximum cardinality such that no two vertices of S are adjacent. This paper …

Given a large social or information network, how can we partition the vertices into sets (ie,
colors) such that no two vertices linked by an edge are in the same set while minimizing the …

The maximum common subgraph problem is to find the largest subgraph common to two
given graphs. This problem can be solved either by constraint-based search, or by reduction …