Computing Maximum Cliques in Unit Disk Graphs

Anastasiia Tkachenko, Haitao Wang

Given a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is…