Skip to content
STIMSMITH

Verma et al. Maximal Clique Enumeration for Custom Instructions

Paper
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
Bron-Kerbosch Maximal Clique Enumeration introduces → 90% 1e
Verma et al. reformulate the problem as maximal clique enumeration
Graph Compaction and Clustering uses → 85% 1e
Verma et al. apply a node-clustering step similar to this work