Raffaele Marino

activity

20152024

most citedThe backtracking survey propagation algorithm for solving random K-SAT problems

57 citations · 139 across the 10 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2020

Large independent sets on random $d$ -regular graphs with fixed degree $d$

Raffaele Marino, Scott Kirkpatrick

This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$ -regular graph with small and fixed degree $d$ . We studied experimental…

cs.DS2018★ 12 cited

Revisiting the Challenges of MaxClique

Raffaele Marino, Scott Kirkpatrick

The MaxClique problem, finding the largest complete subgraph in an Erd{ö}s-R{é}nyi $G (N, p)$ random graph in the large $N$ limit, is a well-known example of a simple problem for whi…

Large independent sets on random d-regular graphs with fixed degree d

Revisiting the Challenges of MaxClique

Large independent sets on random $d$ -regular graphs with fixed degree $d$