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
| Item Type: | Book Section |
|---|---|
| Additional Information: | © 2015 The Authors |
| Divisions: | Statistics |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Date Deposited: | 23 Nov 2017 12:41 |
| Last Modified: | 01 Oct 2024 03:58 |
| URI: | http://eprints.lse.ac.uk/id/eprint/85710 |
Actions (login required)
 |
View Item |
