For two unlabeled graphs $G_1,G_2$ independently sub-sampled from an Erdős-Rényi graph $\mathbf G(n,p)$ by keeping each edge with probability $s$, we aim to recover \emph{as many as possible} of the corresponding vertex pairs. We establish a connection between the recoverability of vertex pairs and the balanced load allocation in the true intersection graph of $ G_1 $ and $ G_2 $. Using this connection, we analyze the partial recovery regime where $ p = n^{-α+ o(1)} $ for some $ α\in (0, 1] $ and $ nps^2 = λ= O(1) $. We derive upper and lower bounds for the recoverable fraction in terms of $ α$ and the limiting load distribution $ μ_λ$ (as introduced in \cite{AS16}). These bounds coincide asymptotically whenever $ α^{-1} $ is not an atom of $ μ_λ$. Therefore, for each fixed $ λ$, our result characterizes the asymptotic optimal recovery fraction for all but countably many $ α\in (0, 1] $.