ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2101.11783
  4. Cited By
Random Graph Matching with Improved Noise Robustness

Random Graph Matching with Improved Noise Robustness

28 January 2021
Cheng Mao
M. Rudelson
K. Tikhomirov
ArXivPDFHTML

Papers citing "Random Graph Matching with Improved Noise Robustness"

6 / 6 papers shown
Title
Graph Alignment via Birkhoff Relaxation
Sushil Mahavir Varma
Irène Waldspurger
Laurent Massoulié
37
0
0
07 Mar 2025
On the Exactness of SDP Relaxation for Quadratic Assignment Problem
On the Exactness of SDP Relaxation for Quadratic Assignment Problem
Shuyang Ling
33
4
0
12 Aug 2024
Robust Graph Matching when Nodes are Corrupt
Robust Graph Matching when Nodes are Corrupt
Taha Ameen
Bruce Hajek
28
4
0
28 Oct 2023
Matching Correlated Inhomogeneous Random Graphs using the $k$-core
  Estimator
Matching Correlated Inhomogeneous Random Graphs using the kkk-core Estimator
Miklós Z. Rácz
Anirudh Sridhar
26
8
0
10 Feb 2023
Random graph matching at Otter's threshold via counting chandeliers
Random graph matching at Otter's threshold via counting chandeliers
Cheng Mao
Yihong Wu
Jiaming Xu
Sophie H. Yu
32
37
0
25 Sep 2022
Testing network correlation efficiently via counting trees
Testing network correlation efficiently via counting trees
Cheng Mao
Yihong Wu
Jiaming Xu
Sophie H. Yu
27
32
0
22 Oct 2021
1