Login / Signup
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.
Marthe Bonamy
Édouard Bonnet
Nicolas Bousquet
Pierre Charbit
Panos Giannopoulos
Eun Jung Kim
Pawel Rzazewski
Florian Sikora
Stéphan Thomassé
Published in:
CoRR (2021)
Keyphrases
</>
maximum clique
matching algorithm
optimal solution
worst case
np hard
graph theory
computational complexity
k means
natural language processing
simulated annealing
clustering method
protein sequences
graph theoretic
minimum spanning tree