The Maximum Clique Problem in a Disk Graph Made Easy

J. Mark Keil, Debajyoti Mondal

A disk graph is an intersection graph of disks in ${\mathbb{R}}^2$. Determining the computational complexity of finding a maximum clique in a disk graph is a long-standing open probl…