1 citations · 1 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
David Gamarnik, Miklós Z. Rácz, Gabe Schoenbach
We study the problem of efficiently finding large common induced subgraphs of two independent Erdős--Rényi random graphs . Recently, Chatterjee and…
cs.DS2024★ 1 cited
Efficient Graph Matching for Correlated Stochastic Block Models
Shuwen Chai, Miklós Z. Rácz
We study learning problems on correlated stochastic block models with two balanced communities. Our main result gives the first efficient algorithm for graph matching in this setti…