Three notes on distributed property testing
From MaRDI portal
Recommendations
Cited in
(24)- Distributed testing of excluded subgraphs
- Deciding and verifying network properties locally with few output bits
- Sublinear-time distributed algorithms for detecting small cliques and even cycles
- Detecting cliques in CONGEST networks
- Property testing of planarity in the \textsf{CONGEST} model
- Distributedly testing cycle-freeness
- Deterministic subgraph detection in broadcast CONGEST
- Lower bounds for subgraph detection in the CONGEST model
- Distribution-Free Property-Testing
- A two-sided error distributed property tester for conductance
- Detecting cliques in CONGEST networks
- Distributed detection of cliques in dynamic networks
- Property testing of planarity in the \textsf{CONGEST} model
- On the multiparty communication complexity of testing triangle-freeness
- Distributed Testing of Graph Isomorphism in the CONGEST Model.
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
- Deterministic near-optimal distributed listing of cliques
- Testing C_k-freeness in bounded-arboricity graphs
- Stochastic distance in property testing
- Brief announcement: Low-distortion clustering in bounded growth graphs
- Even-cycle detection in the randomized and quantum CONGEST model
- Distributed subgraph finding: progress and challenges (invited talk)
This page was built for publication: Three notes on distributed property testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487486)
