Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Daniel Cullina, Negar Kiyavash. Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching. In Sara Alouf, Alain Jean-Marie, Nidhi Hegde, Alexandre Proutière, editors, Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins, France, June 14-18, 2016. pages 63-72, ACM, 2016. [doi]

Abstract

Abstract is missing.