Even-cycle detection in the randomized and quantum CONGEST model
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7559158 (Why is no real title available?)
- scientific article; zbMATH DE number 7829267 (Why is no real title available?)
- scientific article; zbMATH DE number 7788509 (Why is no real title available?)
- A Framework for Distributed Quantum Queries in the CONGEST Model
- A Problem in Graph Theory
- Can quantum communication speed up distributed computation?
- Detecting cliques in CONGEST networks
- Deterministic subgraph detection in broadcast CONGEST
- Distributed Computing: A Locality-Sensitive Approach
- Fast distributed algorithms for girth, cycles and small subgraphs
- Improved distributed expander decomposition and nearly optimal triangle enumeration
- On the power of the congested clique model
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model
- Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Sublinear-time quantum computation of the diameter in CONGEST networks
- Three notes on distributed property testing
- What Can Be Observed Locally?
- ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)
This page was built for publication: Even-cycle detection in the randomized and quantum CONGEST model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971954)
