Distributed verification and hardness of distributed approximation
We study the verification problem in distributed networks, stated as follows. Let H be a
subgraph of a network G where each vertex of G knows which edges incident on it are in H …
subgraph of a network G where each vertex of G knows which edges incident on it are in H …
Distributed approximation algorithms for weighted shortest paths
D Nanongkai - Proceedings of the forty-sixth annual ACM symposium …, 2014 - dl.acm.org
A distributed network is modeled by a graph having n nodes (processors) and diameter D.
We study the time complexity of approximating weighted (undirected) shortest paths on …
We study the time complexity of approximating weighted (undirected) shortest paths on …
Optimal deterministic routing and sorting on the congested clique
C Lenzen - Proceedings of the 2013 ACM symposium on …, 2013 - dl.acm.org
Consider a clique of n nodes, where in each synchronous round each pair of nodes can
exchange O (log n) bits. We provide deterministic constant-time solutions for two problems in …
exchange O (log n) bits. We provide deterministic constant-time solutions for two problems in …
Large-scale graph processing systems: a survey
Graph is a significant data structure that describes the relationship between entries. Many
application domains in the real world are heavily dependent on graph data. However, graph …
application domains in the real world are heavily dependent on graph data. However, graph …
Distributed exact shortest paths in sublinear time
M Elkin - Journal of the ACM (JACM), 2020 - dl.acm.org
The distributed single-source shortest paths problem is one of the most fundamental and
central problems in the message-passing distributed computing. Classical Bellman-Ford …
central problems in the message-passing distributed computing. Classical Bellman-Ford …
The distributed minimum spanning tree problem
The Distributed Computing Column Page 1 The Distributed Computing Column by Stefan
Schmid Faculty of Computer Science, University of Vienna Währinger Strasse 29, AT - 1090 …
Schmid Faculty of Computer Science, University of Vienna Währinger Strasse 29, AT - 1090 …
Universally-optimal distributed algorithms for known topologies
Many distributed optimization algorithms achieve existentially-optimal running times,
meaning that there exists some pathological worst-case topology on which no algorithm can …
meaning that there exists some pathological worst-case topology on which no algorithm can …
“Tri, tri again”: finding triangles and small subgraphs in a distributed setting
Abstract Let G=(V, E) be an n-vertex graph and M dad-vertex graph, for some constant d. Is
M da subgraph of G? We consider this problem in a model where all n processes are …
M da subgraph of G? We consider this problem in a model where all n processes are …
Distributed MST and routing in almost mixing time
We present a randomized distributed algorithm that computes a minimum spanning tree in τ
(G)· 2O (√(log n log log n))) rounds, in any n-node graph G with mixing time τ (G). This result …
(G)· 2O (√(log n log log n))) rounds, in any n-node graph G with mixing time τ (G). This result …
[HTML][HTML] Lessons from the congested clique applied to mapreduce
The main result of this paper is a simulation algorithm which, under quite general
constraints, transforms algorithms running in the Congested Clique model into algorithms …
constraints, transforms algorithms running in the Congested Clique model into algorithms …