1 paper
Akshay Gupte, Yiran Zhu
Computing the maximum size of an independent set in a graph is a famously hard combinatorial problem that has been well-studied for various classes of graphs. When it comes to rand…