Pages that link to "Item:Q661050"
From MaRDI portal
The following pages link to Distributed discovery of large near-cliques (Q661050):
Displaying 11 items.
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← 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)
- A two-sided error distributed property tester for conductance (Q5005119) (← links)
- Detecting cliques in CONGEST networks (Q5090906) (← links)
- (Q5092335) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)