Pages that link to "Item:Q2146871"
From MaRDI portal
The following pages link to Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871):
Displaying 10 items.
- Distributed discovery of large near-cliques (Q661050) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- A note on improved results for one round distributed clique listing (Q2681399) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Lower Bounds for Subgraph Detection in the CONGEST Model (Q3300805) (← links)
- Detecting cliques in CONGEST networks (Q5090906) (← links)
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q6487531) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)