Maximum Clique in Disk-Like Intersection Graphs

by   Édouard Bonnet, et al.

We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Clark '90, Raghavan and Spinrad '03] to translates of any fixed convex set. We also generalize the efficient polynomial-time approximation scheme (EPTAS) and subexponential algorithm for disks [Bonnet et al. '18, Bonamy et al. '18] to homothets of a fixed centrally symmetric convex set. The main open question on that topic is the complexity of Maximum Clique in disk graphs. It is not known whether this problem is NP-hard. We observe that, so far, all the hardness proofs for Maximum Clique in intersection graph classes ℐ follow the same road. They show that, for every graph G of a large-enough class 𝒞, the complement of an even subdivision of G belongs to the intersection class ℐ. Then they conclude invoking the hardness of Maximum Independent Set on the class 𝒞, and the fact that the even subdivision preserves that hardness. However there is a strong evidence that this approach cannot work for disk graphs [Bonnet et al. '18]. We suggest a new approach, based on a problem that we dub Max Interval Permutation Avoidance, which we prove unlikely to have a subexponential-time approximation scheme. We transfer that hardness to Maximum Clique in intersection graphs of objects which can be either half-planes (or unit disks) or axis-parallel rectangles. That problem is not amenable to the previous approach. We hope that a scaled down (merely NP-hard) variant of Max Interval Permutation Avoidance could help making progress on the disk case, for instance by showing the NP-hardness for (convex) pseudo-disks.


Computing a maximum clique in geometric superclasses of disk graphs

In the 90's Clark, Colbourn and Johnson wrote a seminal paper where they...

Finding a Maximum Clique in a Disk Graph

A disk graph is an intersection graph of disks in the Euclidean plane, w...

Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks

Intersection graphs of planar geometric objects such as intervals, disks...

EPTAS for Max Clique on Disks and Unit Balls

We propose a polynomial-time algorithm which takes as input a finite set...

Clique-Based Separators for Geometric Intersection Graphs

Let F be a set of n objects in the plane and let G(F) be its intersectio...

On the generalized Helly property of hypergraphs, cliques, and bicliques

A family of sets is (p,q)-intersecting if every nonempty subfamily of p ...

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

A (unit) disk graph is the intersection graph of closed (unit) disks in ...

Please sign up or login with your details

Forgot password? Click here to reset