Distributed subgraph finding: progress and challenges (invited talk)

DOI10.4230/LIPICS.ICALP.2021.3MaRDI QIDQ7241098zbMATH OpenFDO

Authors Keren Censor-Hillel

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.3

zbMATH Keywords

distributed algorithmslimited bandwidthsubgraph finding

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 177818 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 7559158 (Why is no real title available?)
• scientific article; zbMATH DE number 7561283 (Why is no real title available?)
• scientific article; zbMATH DE number 3031694 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 7788370 (Why is no real title available?)
• scientific article; zbMATH DE number 7788509 (Why is no real title available?)
• Algebraic methods in the congested clique
• An information statistics approach to data stream and communication complexity
• Color-coding
• Detecting cliques in CONGEST networks
• Deterministic distributed expander decomposition and routing with applications in distributed derandomization
• Deterministic subgraph detection in broadcast CONGEST
• Distributed Computing: A Locality-Sensitive Approach
• Distributed MST and routing in almost mixing time
• Distributed computation of large-scale graph problems
• Distributed detection of cliques in dynamic networks
• Distributed discovery of large near-cliques
• Distributed testing of excluded subgraphs
• Distributed triangle detection via expander decomposition
• Fast approximate shortest paths in the congested clique
• Fast distributed algorithms for girth, cycles and small subgraphs
• Fast distributed algorithms for testing graph properties
• Fast distributed coloring algorithms for triangle-free graphs
• Fooling views: a new lower bound technique for distributed computations under congestion
• Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
• Improved distributed expander decomposition and nearly optimal triangle enumeration
• Large cuts with local algorithms on triangle-free graphs
• Locality in Distributed Graph Algorithms
• Lower bounds for subgraph detection in the CONGEST model
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• On Distributed Listing of Cliques
• On the power of the congested clique model
• Optimal deterministic routing and sorting on the congested clique
• Property testing and its connection to learning and approximation
• Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
• Sparse matrix multiplication and triangle listing in the congested clique model
• Sublinear-time distributed algorithms for detecting small cliques and even cycles
• The Probabilistic Communication Complexity of Set Intersection
• The communication complexity of set intersection and multiple equality testing
• Three notes on distributed property testing
• Triangle Finding and Listing in CONGEST Networks
• ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)

Cited in

(1)

• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions

This page was built for publication: Distributed subgraph finding: progress and challenges (invited talk)

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