A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs

  • Authors:
  • Farid Alizadeh

  • Affiliations:
  • Computer Science Department, University of Minnesota, Minneapolis, Mn

  • Venue:
  • SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract