Maximum Clique

Emerging

2papers using it

2024first seen

The 'Maximum Clique' dataset/benchmark contains instances of the maximum clique problem, which is used to evaluate algorithms for finding the largest complete subgraph within a given graph.

🔎 Find this dataset

Papers using Maximum Clique (2)

Separating Ansatz Discovery from Deployment on Larger Problems: Reinforcement Learning for Modular Circuit Design2025

Reinforcement Learning for Variational Quantum Circuits Design2024 · 1 cites