scientific article; zbMATH DE number 6850476
From MaRDI portal
Publication:4608063
zbMath1403.68335arXiv1707.08484MaRDI QIDQ4608063
Tomasz Jurdziński, Krzysztof Nowicki
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1707.08484
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (25)
GHS algorithm on a graph with random weights ⋮ Graph reconstruction in the congested clique ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Deterministic Massively Parallel Connectivity ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Exact distributed sampling ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Distributed PageRank computation with improved round complexities ⋮ Distributed Symmetry Breaking on Power Graphs via Sparsification ⋮ Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Simple Distributed Spanners in Dense Congest Networks ⋮ Low-congestion shortcut and graph parameters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Unnamed Item ⋮ Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds ⋮ Fast approximate shortest paths in the congested clique ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE ⋮ Near-optimal scheduling in the congested clique ⋮ Approximate minimum directed spanning trees under congestion
This page was built for publication:
