Login / Signup

Parallelizing an algorithm to find the maximal clique on interval graphs on graphical processing units.

Christian TrefftzAndrés Santamaría-GalvisRoberto Cruz
Published in: EIT (2014)
Keyphrases
  • learning algorithm
  • np hard
  • bayesian networks
  • processing units
  • minimum spanning tree
  • parallel processing
  • graph theory