Cookies?
Library Header Image
LSE Research Online LSE Library Services

Communication complexity of approximate matching in distributed graphs

Huang, Z., Radunovic, B., Vojnovic, Milan 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

Full text not available from this repository.
Item Type: Book Section
Additional Information: © 2015 The Authors
Divisions: Statistics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Sets: Departments > Statistics
Date Deposited: 23 Nov 2017 12:41
Last Modified: 20 Sep 2019 00:42
URI: http://eprints.lse.ac.uk/id/eprint/85710

Actions (login required)

View Item View Item