On the Multiparty Communication Complexity of Testing Triangle-Freeness

DOI10.1145/3087801.3087821zbMath1380.68423arXiv1705.08438OpenAlexW2618062049MaRDI QIDQ5368951

Orr Fischer, Rotem Oshman, Shay Gershtein

Publication date: 11 October 2017

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

Full work available at URL: https://arxiv.org/abs/1705.08438

zbMATH Keywords

communication complexityproperty testingtriangle-freeness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Property testing of planarity in the \textsf{CONGEST} model ⋮ Distributed Testing of Graph Isomorphism in the CONGEST Model.

This page was built for publication: On the Multiparty Communication Complexity of Testing Triangle-Freeness