Corpus ID: 732657

Non-Local Probes Do Not Help with Graph Problems

  title={Non-Local Probes Do Not Help with Graph Problems},
  author={Mika G{\"o}{\"o}s and J. Hirvonen and Reut Levi and M. Medina and Jukka Suomela},
  • Mika Göös, J. Hirvonen, +2 authors Jukka Suomela
  • Published 2015
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING
    3 Citations

    Figures, Tables, and Topics from this paper


    Best of Two Local Models: Local Centralized and Local Distributed Algorithms
    • 24
    • PDF
    Locality in Distributed Graph Algorithms
    • N. Linial
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1992
    • 817
    • Highly Influential
    • PDF
    Local Computation Algorithms for Graphs of Non-Constant Degrees
    • 18
    • PDF
    Converting Online Algorithms to Local Computation Algorithms
    • 57
    • PDF
    Survey of local algorithms
    • 188
    • PDF
    Leveraging Linial's Locality Limit
    • 85
    • PDF
    Local Computation Algorithms for Graphs of Non-constant Degrees
    • 14
    Space-efficient local computation algorithms
    • 80
    • PDF
    Constant-Time Approximation Algorithms via Local Improvements
    • 168
    • PDF