You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I used SimRank successfully on provided examples from the paper (university web graph, a bipartie graph of cake-bakers). However, when I try to run in on my graph which counts 144380 nodes and 223531 edges, I get the Memory Error Exception. The paper says they run the algorithm on 688,898 nodes 278,628 edges graph. Did you try your implementation on bigger graphs (real world graphs) than on provided examples?
Thanks,
The text was updated successfully, but these errors were encountered:
Hi Chen,
thanks for GraphSim!
I used SimRank successfully on provided examples from the paper (university web graph, a bipartie graph of cake-bakers). However, when I try to run in on my graph which counts 144380 nodes and 223531 edges, I get the Memory Error Exception. The paper says they run the algorithm on 688,898 nodes 278,628 edges graph. Did you try your implementation on bigger graphs (real world graphs) than on provided examples?
Thanks,
The text was updated successfully, but these errors were encountered: