Pages that link to "Item:Q2220401"
From MaRDI portal
The following pages link to Detecting cliques in CONGEST networks (Q2220401):
Displaying 14 items.
- Finding clique clusters with the highest betweenness centrality (Q724070) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← 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)
- Detecting the number of clusters in a network (Q4958809) (← links)
- On the detection of transitive clusters in undirected networks (Q5036515) (← links)
- Detecting cliques in CONGEST networks (Q5090906) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q6487531) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)