A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs

Jian Ding, Hang Du, Shuyang Gong. A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs. Random Struct. Algorithms, 65(1):220-257, 2024. [doi]

Abstract

Abstract is missing.