Non-local Probes Do Not Help with Many Graph Problems

  • Mika Göös
  • Juho Hirvonen
  • Reut Levi
  • Moti Medina
  • Jukka Suomela
Conference paper

DOI: 10.1007/978-3-662-53426-7_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9888)
Cite this paper as:
Göös M., Hirvonen J., Levi R., Medina M., Suomela J. (2016) Non-local Probes Do Not Help with Many Graph Problems. In: Gavoille C., Ilcinkas D. (eds) Distributed Computing. DISC 2016. Lecture Notes in Computer Science, vol 9888. Springer, Berlin, Heidelberg

Abstract

This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to be much more powerful than distributed message-passing algorithms: centralised algorithms can directly probe any part of the input, while in distributed algorithms nodes can only communicate with their immediate neighbours. We show that for a large class of graph problems, this extra freedom does not help centralised algorithms at all: efficient stateless deterministic centralised local algorithms can be simulated with efficient distributed message-passing algorithms. In particular, this enables us to transfer existing lower bound results from distributed algorithms to centralised local algorithms.

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Mika Göös
    • 1
  • Juho Hirvonen
    • 2
  • Reut Levi
    • 3
  • Moti Medina
    • 3
  • Jukka Suomela
    • 2
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada
  2. 2.Helsinki Institute for Information Technology HIIT, Department of Computer ScienceAalto UniversityEspooFinland
  3. 3.MPI for InformaticsSaarbrückenGermany

Personalised recommendations