External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Communication Complexity of Approximate Matching in Distributed Graphs

Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang. Communication Complexity of Approximate Matching in Distributed Graphs. In Ernst W. Mayr, Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Volume 30 of LIPIcs, pages 460-473, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

Authors

Zengfeng Huang

This author has not been identified. Look up 'Zengfeng Huang' in Google

Bozidar Radunovic

This author has not been identified. Look up 'Bozidar Radunovic' in Google

Milan Vojnovic

This author has not been identified. Look up 'Milan Vojnovic' in Google

Qin Zhang

This author has not been identified. Look up 'Qin Zhang' in Google
runs on