Communication Complexity of Approximate Matching in Distributed Graphs

Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang. Communication Complexity of Approximate Matching in Distributed Graphs. In Ernst W. Mayr, Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Volume 30 of LIPIcs, pages 460-473, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

Abstract

Abstract is missing.