Acesso rápido

No journals followed

Browse journals

No saved papers

Política de privacidade

Feed Explorar Tendências Perguntas Pesquisadores

⌘K

September 1, 1973Open Access

Algoritmo 457: encontrando todas as cliques de um grafo não direcionado

Key Points

Key points are not available for this paper at this time.

Abstract

Introdução. Um subgrafo completo maximal (clique) é um subgrafo completo que não está contido em nenhum outro subgrafo completo.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Loading...

Authors

C

Coen Bron

J

Joep Kerbosch

Journals

Communications of the ACM

Actions

Institutions

Eindhoven University of Technology

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Loading...

Cite this study

Bron et al. (Sat,) estudaram esta questão.

www.synapsesocial.com/papers/69d6fd8e733a2b54c8aa883c — DOI: https://doi.org/10.1145/362342.362367

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Corrections to Bierstone's Algorithm for Generating Cliques· 1972 · 73 citations
Algorithm 202: generation of permutations in lexicographical order· 1963 · 15 citations
Finding cliques in an undirected graph· 1972 · 16 citations
An Algorithm for the Traveling Salesman Problem· 1963 · 1,044 citations
On cliques in graphs· 1965 · 850 citations

Algoritmo 457: encontrando todos os cliques de um grafo não direcionado | Synapse