The following pages link to (Q5092335):
Displaying 6 items.
- Distributed discovery of large near-cliques (Q661050) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- Distributed detection of clusters of arbitrary size (Q2117744) (← links)
- A note on improved results for one round distributed clique listing (Q2681399) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- On linear algebraic algorithms for the subgraph matching problem and its variants (Q6164954) (← links)