|
 | Up a level |
Huang, Z., Radunovic, B., Vojnovic, Milan 
ORCID: 0000-0003-1382-022X and Zhang, Q.
(2015)
Communication complexity of approximate matching in distributed graphs.
In:
32nd International Symposium on Theoretical Aspects of Computer Science, 04 Mar 2015.
Schloss Dagstuhl - Leibniz International Proceedings in Informatics, Garching, Germany, pp. 460-473.
ISBN 9783939897781
