Pages that link to "Item:Q3300805"
From MaRDI portal
The following pages link to Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805):
Displaying 6 items.
- 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)
- (Q5090906) (← links)
- (Q5092335) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
