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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Random structures & algorithms Jg. 65; H. 1; S. 220 - 257
Hauptverfasser:	Ding, Jian, Du, Hang, Gong, Shuyang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York John Wiley & Sons, Inc 01.08.2024 Wiley Subscription Services, Inc
Schlagworte:	Algorithms Graph theory Graphs greedy algorithm Polynomials polynomial‐time approximation scheme random graph matching
ISSN:	1042-9832, 1098-2418
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!