54 citations · 152 across the 16 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021★ 13 cited
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet +6
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Cliq…
cs.LG2021
Scaling up graph homomorphism for classification via sampling
Paul Beaujean, Florian Sikora, Florian Yger
Feature generation is an open topic of investigation in graph machine learning. In this paper, we study the use of graph homomorphism density features as a scalable alternative to…