Skip to content
STIMSMITH

Bron-Kerbosch Maximal Clique Enumeration

Technique
First seen 8/2/2026
Last seen 8/2/2026
Evidence 2 chunks

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

2 connections
Maximal Convex Subgraph Enumeration compares with → 95% 1e
The enumeration algorithm is compared in runtime with Bron-Kerbosch clique enumeration
Verma et al. reformulate the problem as maximal clique enumeration