Login / Signup

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.

Édouard BonnetPanos GiannopoulosEun Jung KimPawel RzazewskiFlorian Sikora
Published in: SoCG (2018)
Keyphrases
  • maximum clique
  • computational complexity
  • worst case
  • matching algorithm
  • optimal solution
  • np hard
  • graph theory
  • special case
  • image matching
  • similarity measure
  • weighted graph
  • spanning tree