Pages that link to "Item:Q3300802"
From MaRDI portal
The following pages link to Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802):
Displaying 13 items.
- Dynamic detection of subgraphs in computer networks (Q1263956) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- A note on improved results for one round distributed clique listing (Q2681399) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- Detecting cliques in CONGEST networks (Q5090906) (← links)
- (Q5092335) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q6487531) (← links)
- Fast distributed algorithms for girth, cycles and small subgraphs (Q6535032) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)