2 papers
cs.CG2020
Maximum Clique in Disk-Like Intersection Graphs
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
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 [Cl…
cs.DM2016
Neighborhood-Preserving Translations on Graphs
Nicolas Grelier, Bastien Pasdeloup, Jean-Charles Vialatte +1
In many domains (e.g. Internet of Things, neuroimaging) signals are naturally supported on graphs. These graphs usually convey information on similarity between the values taken by…