57 citations · 139 across the 10 of their papers we have counts for
1 paper · 1 filter
Raffaele Marino, Scott Kirkpatrick
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erdös-Rényi G(N, p) random graph. We use Maximum Clique…