works on
algorithm design 1graph matching 1local tree tests 1random graphs 1rank-based methods 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.DS2026

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests

Jiale Cheng, Ziao Wang, Lei Ying

The paper proposes a near‑quadratic‑time algorithm that uses rank‑based local tree correlation tests to match vertices in correlated Erdős–Rényi graph pairs, achieving almost exact…