Login / Signup
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions
Peyman Afshani
Hamed Hatami
Published in:
CoRR (2007)
Keyphrases
</>
maximum clique
high dimensions
approximation algorithms
branch and bound algorithm
association graph
high dimensional data
maximal cliques
computational biology
graph theory
np hard
high dimensional
high dimensional spaces
poor quality
lower bound
contact map
optimal solution
graph matching
pattern recognition