Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning

1 code implementation • 5 Jan 2022 • Itay Levinas, yoram louzoun

We show that PYGON can recover cliques of sizes $\Theta\left(\sqrt{n}\right)$, where $n$ is the size of the background graph, comparable with the state of the art.

PAC learning