Non-local probes do not help with many graph problems

Mika Göös; Juho Hirvonen; Reut Levi; Moti Medina; Jukka Suomela

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

Non-local probes do not help with many graph problems

Mika Göös, Juho Hirvonen, Reut Levi, Moti Medina, Jukka Suomela

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

12 Scopus citations

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.

Original language	English
Title of host publication	Distributed Computing - 30th International Symposium, DISC 2016, Proceedings
Editors	Cyril Gavoille, David Ilcinkas
Publisher	Springer Verlag
Pages	201-214
Number of pages	14
ISBN (Print)	9783662534250
DOIs	https://doi.org/10.1007/978-3-662-53426-7_15
State	Published - 2016
Externally published	Yes
Event	30th International Symposium on Distributed Computing, DISC 2016 - Paris, France Duration: 27 Sep 2016 → 29 Sep 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9888 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	30th International Symposium on Distributed Computing, DISC 2016
Country/Territory	France
City	Paris
Period	27/09/16 → 29/09/16

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2016.

Access to Document

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

Cite this

Göös, M., Hirvonen, J., Levi, R., Medina, M., & Suomela, J. (2016). Non-local probes do not help with many graph problems. In C. Gavoille, & D. Ilcinkas (Eds.), Distributed Computing - 30th International Symposium, DISC 2016, Proceedings (pp. 201-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9888 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-53426-7_15

Göös, Mika ; Hirvonen, Juho ; Levi, Reut et al. / Non-local probes do not help with many graph problems. Distributed Computing - 30th International Symposium, DISC 2016, Proceedings. editor / Cyril Gavoille ; David Ilcinkas. Springer Verlag, 2016. pp. 201-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{4d281a10c4f34cb9813eb35c3bebdac2,

title = "Non-local probes do not help with many graph problems",

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.",

author = "Mika G{\"o}{\"o}s and Juho Hirvonen and Reut Levi and Moti Medina and Jukka Suomela",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2016.; 30th International Symposium on Distributed Computing, DISC 2016 ; Conference date: 27-09-2016 Through 29-09-2016",

year = "2016",

doi = "10.1007/978-3-662-53426-7\_15",

language = "אנגלית",

isbn = "9783662534250",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "201--214",

editor = "Cyril Gavoille and David Ilcinkas",

booktitle = "Distributed Computing - 30th International Symposium, DISC 2016, Proceedings",

address = "גרמניה",

}

Göös, M, Hirvonen, J, Levi, R, Medina, M & Suomela, J 2016, Non-local probes do not help with many graph problems. in C Gavoille & D Ilcinkas (eds), Distributed Computing - 30th International Symposium, DISC 2016, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9888 LNCS, Springer Verlag, pp. 201-214, 30th International Symposium on Distributed Computing, DISC 2016, Paris, France, 27/09/16. https://doi.org/10.1007/978-3-662-53426-7_15

Non-local probes do not help with many graph problems. / Göös, Mika; Hirvonen, Juho; Levi, Reut et al.
Distributed Computing - 30th International Symposium, DISC 2016, Proceedings. ed. / Cyril Gavoille; David Ilcinkas. Springer Verlag, 2016. p. 201-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9888 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Non-local probes do not help with many graph problems

AU - Göös, Mika

AU - Hirvonen, Juho

AU - Levi, Reut

AU - Medina, Moti

AU - Suomela, Jukka

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84988569110

U2 - 10.1007/978-3-662-53426-7_15

DO - 10.1007/978-3-662-53426-7_15

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84988569110

SN - 9783662534250

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 201

EP - 214

BT - Distributed Computing - 30th International Symposium, DISC 2016, Proceedings

A2 - Gavoille, Cyril

A2 - Ilcinkas, David

PB - Springer Verlag

T2 - 30th International Symposium on Distributed Computing, DISC 2016

Y2 - 27 September 2016 through 29 September 2016

ER -

Göös M, Hirvonen J, Levi R, Medina M, Suomela J. Non-local probes do not help with many graph problems. In Gavoille C, Ilcinkas D, editors, Distributed Computing - 30th International Symposium, DISC 2016, Proceedings. Springer Verlag. 2016. p. 201-214. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-53426-7_15

Non-local probes do not help with many graph problems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this