Distributed Testing of Graph Isomorphism in the CONGEST Model.
From MaRDI portal
Publication:6084362
DOI10.4230/lipics.approx/random.2020.19arXiv2003.00468OpenAlexW3081582674MaRDI QIDQ6084362
Publication date: 31 October 2023
Full work available at URL: https://arxiv.org/abs/2003.00468
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- Distributed testing of excluded subgraphs
- Detecting cliques in CONGEST networks
- Fooling views: a new lower bound technique for distributed computations under congestion
- On graph problems in a semi-streaming model
- Every Property of Hyperfinite Graphs Is Testable
- On Testing Expansion in Bounded-Degree Graphs
- Property testing and its connection to learning and approximation
- Deterministic Subgraph Detection in Broadcast CONGEST.
- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
- Testing Graph Isomorphism in Parallel by Playing a Game
- Testing Graph Isomorphism
- Parallel algorithms for planar graph isomorphism and related problems
- Locality in Distributed Graph Algorithms
- Distributed Computing: A Locality-Sensitive Approach
- Tight Bounds for Testing Bipartiteness in General Graphs
- Communication Complexity
- Sublinear Random Access Generators for Preferential Attachment Graphs.
- Testing Forest-Isomorphism in the Adjacency List Model
- Property Testing of Planarity in the CONGEST model
- The query complexity of graph isomorphism: bypassing distribution testing lower bounds
- Distributed Triangle Detection via Expander Decomposition
- On the Multiparty Communication Complexity of Testing Triangle-Freeness
- Triangle Finding and Listing in CONGEST Networks
- Testing Closeness of Discrete Distributions
- The Power of Linear Estimators
- Logical Approaches to Computational Barriers
- Fast distributed algorithms for testing graph properties
- Property testing in bounded degree graphs
This page was built for publication: Distributed Testing of Graph Isomorphism in the CONGEST Model.
