``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)

DOI10.1007/978-3-642-33651-5_14zbMATH Open1377.68316OpenAlexW1845051857MaRDI QIDQ4909412FDOQ4909412

Shir Peled, Christoph Lenzen, Danny Dolev

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_14

Recommendations

• Triangle Finding and Listing in CONGEST Networks
• Distributed triangle detection via expander decomposition
• Deterministic subgraph detection in broadcast CONGEST
• Approximately counting triangles in sublinear time
• On the power of the congested clique model

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distributed algorithms (68W15)

Cited In (25)

• Title not available (Why is that?)
• Fast distributed algorithms for testing graph properties
• Fooling views: a new lower bound technique for distributed computations under congestion
• Near-optimal Distributed Triangle Enumeration via Expander Decompositions
• Near-optimal scheduling in the congested clique
• Derandomizing local distributed algorithms under bandwidth restrictions
• Sublinear-time distributed algorithms for detecting small cliques and even cycles
• Title not available (Why is that?)
• Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE
• Reliable communication over highly connected noisy networks
• The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model
• Fast distributed algorithms for girth, cycles and small subgraphs
• Lessons from the congested clique applied to MapReduce
• Detecting cliques in CONGEST networks
• Distributed Discovery of Large Near-Cliques
• Deterministic Subgraph Detection in Broadcast CONGEST.
• Lower Bounds for Subgraph Detection in the CONGEST Model
• Fast approximate shortest paths in the congested clique
• Deterministic near-optimal distributed listing of cliques
• Sparse matrix multiplication and triangle listing in the congested clique model
• Algebraic methods in the congested clique
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
• Title not available (Why is that?)
• Dynamic detection of subgraphs in computer networks
• Fault-tolerant graph realizations in the congested clique

This page was built for publication: ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)

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