• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs.

Binay K. BhattacharyaDamon Kaller
Published in: J. Algorithms (1997)
Keyphrases
  • worst case
  • graph structure
  • learning algorithm
  • natural images
  • optimal solution
  • high dimensional
  • computer vision
  • np hard
  • matching algorithm