Algebraic methods in the congested clique

DOI10.1145/2767386.2767414MaRDI QIDQ6827961zbMATH OpenFDO

Authors Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/11858/00-001M-0000-002A-07AA-9

zbMATH Keywords

congested clique modeldistance computationdistributed computinglower boundsmatrix multiplicationsubgraph detection

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Approximation algorithms (68W25)

Cited in

(1)

• Massively parallel approximate Steiner tree algorithms

This page was built for publication: Algebraic methods in the congested clique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827961)