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

DOI10.1002/rsa.21212MaRDI QIDQ6641062

Jian Ding, Hang Du, Shuyang Gong

Publication date: 20 November 2024

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmpolynomial-time approximation schemerandom graph matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs