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]
@inproceedings{HuangRVZ15,
title = {Communication Complexity of Approximate Matching in Distributed Graphs},
author = {Zengfeng Huang and Bozidar Radunovic and Milan Vojnovic and Qin Zhang},
year = {2015},
doi = {10.4230/LIPIcs.STACS.2015.460},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2015.460},
researchr = {https://researchr.org/publication/HuangRVZ15},
cites = {0},
citedby = {0},
pages = {460-473},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany},
editor = {Ernst W. Mayr and Nicolas Ollinger},
volume = {30},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-78-1},
}