Triangle Finding and Listing in CONGEST Networks
From MaRDI portal
Publication:5368990
DOI10.1145/3087801.3087811zbMath1380.68430arXiv1705.09061OpenAlexW2618303782MaRDI QIDQ5368990
Taisuke Izumi, François Le Gall
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.09061
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items
Sublinear-time distributed algorithms for detecting small cliques and even cycles, Deterministic Subgraph Detection in Broadcast CONGEST., Lower Bounds for Subgraph Detection in the CONGEST Model, A note on improved results for one round distributed clique listing, Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?, Detecting cliques in CONGEST networks, Fooling views: a new lower bound technique for distributed computations under congestion, Distributed Testing of Graph Isomorphism in the CONGEST Model., Unnamed Item, Unnamed Item, Fast distributed algorithms for testing graph properties, Unnamed Item, Sparse matrix multiplication and triangle listing in the congested clique model, The Communication Complexity of Set Intersection and Multiple Equality Testing, Near-optimal scheduling in the congested clique
