"A polynomial-time approximation scheme for the maximal overlap of two ..."

Jian Ding, Hang Du, Shuyang Gong (2024)

> Home

Details and statistics

DOI: 10.1002/RSA.21212

access: closed

type: Journal Article

metadata version: 2025-05-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/DingDG24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/DingDG24
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.