Recovering the hidden vertex correspondence between two edge-correlated random graphs offers a rich set of problems involving the interplay of algorithms, complexity, and information limits. This talk will present an overview and recent results on this topic.