Communication complexity of approximate matching in distributed graphs

Huang, Z., Radunovic, B., Vojnovic, M.ORCID logo & Zhang, Q. (2015). Communication complexity of approximate matching in distributed graphs. In 32nd International Symposium on Theoretical Aspects of Computer Science, 04 Mar 2015 (pp. 460-473). Schloss Dagstuhl - Leibniz International Proceedings in Informatics.
Copy
Item Type Chapter
Copyright holders © 2015 The Authors
Departments LSE > Academic Departments > Statistics
Date Deposited 23 Nov 2017
URI https://researchonline.lse.ac.uk/id/eprint/85710

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics