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

For two independent Erdős–Rényi graphs G(n,p)$$ \mathbf{G}\left(n,p\right) $$, we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence. We present a polynomial‐time algorithm which finds a vertex correspondence whose overlap approxi...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 65; no. 1; pp. 220 - 257
Main Authors:	Ding, Jian, Du, Hang, Gong, Shuyang
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.08.2024 Wiley Subscription Services, Inc
Subjects:	Algorithms Graph theory Graphs greedy algorithm Polynomials polynomial‐time approximation scheme random graph matching
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!