Fast allpairs SimRank assessment on large graphs and bipartite domains
 Publisher: IEEE

Related identifiers: doi: 10.1109/TKDE.2014.2339828, doi: 10.1109/TKDE.2014.2339828 
Subject:acm: MathematicsofComputing_DISCRETEMATHEMATICS

References
(21)
[1] I. Antonellis, H. G. Molina, and C. Chang. SimRank++: query rewriting through link analysis of the click graph. PVLDB, 1:408421, 2008.
[2] U. M. Ascher and L. R. Petzold. Computer Methods for Ordinary Differential Equations and DifferentialAlgebraic Equations. Society for Industrial and Applied Mathematics, 1998.
[3] P. Berkhin. Survey: a survey on PageRank computing. Internet Mathematics, 2:73120, 2005.
[4] G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM, 2008.
[5] J. Cho and S. Roy. Impact of search engines on page popularity. In WWW, 2004.
[6] D. Fogaras and B. Ra´cz. Scaling linkbased similarity search. In WWW, 2005.
[7] Y. Fujiwara, M. Nakatsuji, H. Shiokawa, and M. Onizuka. Efficient search algorithm for SimRank. In ICDE, 2013.
[8] H. N. Gabow, Z. Galil, T. H. Spencer, and R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6:109122, 1986.
[9] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman, 1979.
[10] M. Hassani. Approximation of the Lambert W function. RGMIA Research Report Collection, 8, 2005.

Similar Research Results
(20)
20 research results, page 1 of 2
 1
 2

Metrics
No metrics available

 Download from


 Funded by

Cite this publication