A fast parallel algorithm for computing all maximal cliques in a graph and the related problems

  • Authors:
  • Elias Dahlhaus;Marek Karpinski

  • Affiliations:
  • Univ. of Bonn, Bonn, FRG;Univ. of Bonn, Bonn, FRG

  • Venue:
  • No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract