34
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Algorithm 457: finding all cliques of an undirected graph

      ,
      Communications of the ACM
      Association for Computing Machinery (ACM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Journal
          Communications of the ACM
          Commun. ACM
          Association for Computing Machinery (ACM)
          00010782
          September 1973
          : 16
          : 9
          : 575-577
          Article
          10.1145/362342.362367
          f059437b-54c0-40f3-afad-46d3b9ac07ab
          History

          Comments

          Comment on this article