Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
From MaRDI portal
Publication:1660920
DOI10.1007/978-3-662-53426-7_5zbMath1393.68185arXiv1608.02674OpenAlexW2511108295MaRDI QIDQ1660920
Publication date: 16 August 2018
Full work available at URL: https://arxiv.org/abs/1608.02674
Symbolic computation and algebraic computation (68W30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (10)
Single-source shortest paths in the CONGEST model with improved bounds ⋮ On approximating the eigenvalues of stochastic matrices in probabilistic logspace ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Unnamed Item ⋮ Sparse matrix multiplication and triangle listing in the congested clique model ⋮ Fast approximate shortest paths in the congested clique ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time ⋮ Near-optimal scheduling in the congested clique
This page was built for publication: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
