slides - SNAP - Stanford University
slides - SNAP - Stanford University
slides - SNAP - Stanford University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
(2) A more well‐defined well defined problem:<br />
Enumerate complete bipartite subgraphs K s,t<br />
Where K Ks,t = s nodes where each links to the<br />
same t other nodes<br />
[Kumar et al. ‘99]<br />
11/8/2010 Jure Leskovec, <strong>Stanford</strong> CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu 5