Researchclopedia

Research Researchers Institutions Topics Submit About

Command Palette

Search for a command to run...

Researchclopedia

Research Researchers Institutions About

© 2026 Researchclopedia. Powered by OpenAlex under CC0 license.

Back to research

Algorithm 457: finding all cliques of an undirected graph

19732,429 citationsJournal Articlebronze Open Access

Authors

Coen Bron · Eindhoven University of Technology

Joep Kerbosch · Eindhoven University of Technology

Abstract

bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph.

Topics & Keywords

Advanced Graph Theory Research Graph Labeling and Dimension Problems graph theory and CDMA systems

UN Sustainable Development Goals

Partnerships for the goals

Publication Details

Published in: Communications of the ACM

Volume 16, Issue 9, pp. 575-577

DOI: 10.1145/362342.362367

Field-Weighted Citation Impact: 3.28

Algorithm 457: finding all cliques of an undirected graph | Researchclopedia