DeepAI AI Chat
Log In Sign Up

Revisiting the Challenges of MaxClique

by   Raffaele Marino, et al.
Hebrew University of Jerusalem

The MaxClique problem, finding the maximum complete subgraph in an E-R G(N,p) random graph in the large N limit, is a very early example of a simple problem for which finding any approximate solution within a factor of 2 of the known, probabilistically determined limit, appears to require P=NP. This type of search has practical importance in very large graphs. Ways of viewing the problem in its configuration space are similar to the issues raised in the hard core model as a means of understanding glass formation. Algorithmic approaches run into phase boundaries. And, most appealing, there is an extensive literature of challenges posed for concrete methods of finding maximum naturally occurring as well as artificially hidden cliques. We use the probabilistic approach in a novel way to provide a more insightful test of constructive algorithms for this problem. We show that improvements over existing methods are possible, meeting the challenges for practical problems with N as large as 10^10 and perhaps longer.


page 1

page 2

page 3

page 4


Proportionally dense subgraph of maximum size: complexity and approximation

We define a proportionally dense subgraph (PDS) as an induced subgraph o...

Hard Optimization Problems have Soft Edges

Finding a Maximum Clique is a classic property test from graph theory; f...

Subexponential parameterized algorithms and kernelization on almost chordal graphs

We study the algorithmic properties of the graph class Chordal-ke, that ...

The Open Problem of Finding a General Classification of Geodetic Graphs

This note describes some open problems that can be examined with the pur...

(Wireless) Scheduling, Graph Classes, and c-Colorable Subgraphs

Inductive k-independent graphs are a generalization of chordal graphs an...

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees

The Euler tour technique is a classical tool for designing parallel grap...