Communication complexity of approximate matching in distributed graphs

Huang, Z.; Radunovic, B.; Vojnovic, MilanORCID logo; 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
Copy
Item Type Chapter
Departments Statistics
Date Deposited 23 Nov 2017 12:41
URI https://researchonline.lse.ac.uk/id/eprint/85710

Explore Further

Full text not available from this repository.

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads