A Polynomial-Time Iterative Algorithm for Random Graph Matching with Nonvanishing Correlation
Published Online:29 Dec 2025https://doi.org/10.1287/moor.2024.0487
- Cited by
- 18 April 2025 | Operations Research, Vol. 74, No. 1
Articles In Advance
Article Information
Supplemental Material
Metrics
Information
- Received:April 22, 2024
- Accepted:November 16, 2025
- Published Online:December 29, 2025
Copyright © 2025, INFORMS
Cite as
Jian Ding, Zhangsong Li (2026) A Polynomial-Time Iterative Algorithm for Random Graph Matching with Nonvanishing Correlation. Mathematics of Operations Research 0(0).
https://doi.org/10.1287/moor.2024.0487
Keywords
The authors thank Zongming Ma, Yihong Wu, Jiaming Xu, and Fan Yang for stimulating discussions on random graph matching problems. The authors also thank two anonymous reviewers for their careful reading and helpful comments, which lead to a significant improvement on exposition.
