Deterministic Subgraph Detection in Broadcast CONGEST.
From MaRDI portal
Publication:3300802
DOI10.4230/LIPIcs.OPODIS.2017.4zbMath1487.68046arXiv1705.10195OpenAlexW2962700204MaRDI QIDQ3300802
Janne H. Korhonen, Joel Rybicki
Publication date: 30 July 2020
Full work available at URL: https://arxiv.org/abs/1705.10195
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items (8)
Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ A note on improved results for one round distributed clique listing ⋮ On the power of threshold-based algorithms for detecting cycles in the CONGEST model ⋮ Detecting cliques in CONGEST networks ⋮ Distributed Testing of Graph Isomorphism in the CONGEST Model. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Communication Complexity of Set Intersection and Multiple Equality Testing
Cites Work
- Unnamed Item
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- A parameterized view on matroid optimization problems
- Distributed testing of excluded subgraphs
- Algebraic methods in the congested clique
- Narrow sieves for parameterized paths and packings
- A note on the Turán function of even cycles
- On the power of the congested clique model
- The Locality of Distributed Symmetry Breaking
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
- Color-coding
- Distributed Computing: A Locality-Sensitive Approach
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Engineering Motif Search for Large Graphs
- A Problem in Graph Theory
- Triangle Finding and Listing in CONGEST Networks
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
- Decomposition of Finite Graphs Into Forests
- Fast distributed algorithms for testing graph properties
This page was built for publication: Deterministic Subgraph Detection in Broadcast CONGEST.
