{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T13:01:59Z","timestamp":1777554119836,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,12,7]],"date-time":"2010-12-07T00:00:00Z","timestamp":1291680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1007\/s11280-010-0100-6","type":"journal-article","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T10:35:30Z","timestamp":1291631730000},"page":"327-353","source":"Crossref","is-referenced-by-count":48,"title":["A space and time efficient algorithm for SimRank computation"],"prefix":"10.1007","volume":"15","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajin","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,7]]},"reference":[{"issue":"1","key":"100_CR1","first-page":"408","volume":"1","author":"I Antonellis","year":"2008","unstructured":"Antonellis, I., Garcia-Molina, H., Chang, C.C.: Simrank+\u2009+: query rewriting through link analysis of the click graph. PVLDB 1(1), 408\u2013421 (2008)","journal-title":"PVLDB"},{"key":"100_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, New York (1997)"},{"key":"100_CR3","unstructured":"Cai, Y., Li, P., Liu, H., He, J., Du, X.: S-simrank: combining content and link information to cluster papers effectively and efficiently. In: ADMA (2008)"},{"issue":"1","key":"100_CR4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BF01933580","volume":"20","author":"WM Chan","year":"1980","unstructured":"Chan, W.M., George, A.: A linear time implementation of the reverse cuthill-mckee algorithm. BIT 20(1), 8\u201314 (1980)","journal-title":"BIT"},{"key":"100_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00268135","volume":"6","author":"J Cohen","year":"1976","unstructured":"Cohen, J., Roth, M.S.: On the implementation of strassen\u2019s fast multiplication algorithm. Acta Inf. 6, 341\u2013355 (1976)","journal-title":"Acta Inf."},{"issue":"3","key":"100_CR6","first-page":"82","volume":"11","author":"D Coppersmith","year":"1982","unstructured":"Coppersmith, D., Winograd, S.: On the asymptotic complexity of matrix multiplication. SIAM J. Comput. 11(3), 82\u201390 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"100_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 1\u20136 (1990)","journal-title":"J. Symb. Comput."},{"key":"100_CR8","doi-asserted-by":"crossref","unstructured":"D\u2019Azevedo, E.F., Fahey, M.R., Mills, R.T.: Vectorized sparse matrix multiply for compressed row storage format. In: International Conference on Computational Science (1) (2005)","DOI":"10.1007\/11428831_13"},{"key":"100_CR9","doi-asserted-by":"crossref","unstructured":"Fogaras, D., Racz, B.: A scalable randomized method to compute link-based similarity rank on the web graph. In: EDBT Workshops (2004)","DOI":"10.1007\/978-3-540-30192-9_55"},{"key":"100_CR10","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: WWW (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"100_CR11","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel simrank computation on large graphs with iterative aggregation. In: KDD (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"100_CR12","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: KDD (2002)","DOI":"10.1145\/775047.775126"},{"key":"100_CR13","doi-asserted-by":"crossref","unstructured":"Li, P., Cai, Y., Liu, H., He, J., Du, X.: Exploiting the block structure of link graph for efficient similarity computation. In: PAKDD (2009)","DOI":"10.1007\/978-3-642-01307-2_36"},{"key":"100_CR14","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.: Fast computation of simrank for static and dynamic information networks. In: EDBT (2010)","DOI":"10.1145\/1739041.1739098"},{"issue":"1","key":"100_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ejor.2005.02.066","volume":"174","author":"A Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., Xiao, F.: Heuristics for matrix bandwidth reduction. Eur. J. Oper. Res. 174(1), 69\u201391 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"100_CR16","first-page":"422","volume":"1","author":"D Lizorkin","year":"2008","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M., Turdakov, D.: Accuracy estimate and optimization techniques for simrank computation. PVLDB 1(1), 422\u2013433 (2008)","journal-title":"PVLDB"},{"issue":"1","key":"100_CR17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s00778-009-0168-8","volume":"19","author":"D Lizorkin","year":"2010","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for simrank computation. VLDB J. 19(1), 45\u201366 (2010)","journal-title":"VLDB"},{"key":"100_CR18","first-page":"604","volume":"1","author":"AO Mendelzon","year":"2000","unstructured":"Mendelzon, A.O.: Review\u2014authoritative sources in a hyperlinked environment. ACM SIGMOD Digit. Rev. 1, 604\u2013632 (2000)","journal-title":"ACM SIGMOD Digit. Rev."},{"key":"100_CR19","unstructured":"Page, L., Brin, S.R.M., Winograd, T.: The pagerank citation ranking bringing order to the web. Technial report (1998)"},{"key":"100_CR20","doi-asserted-by":"crossref","unstructured":"Pathak, A., Chakrabarti, S., Gupta, M.S.: Index design for dynamic personalized pagerank. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497599"},{"key":"100_CR21","unstructured":"Quevedo, J.U., Huang, S.H.S.: Similarity among web pages based on their link structure. In: IKE (2003)"},{"issue":"5\u20136","key":"100_CR22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0271(74)90058-8","volume":"10","author":"BH Weinberg","year":"1974","unstructured":"Weinberg, B.H.: Bibliographic coupling: a review. Inf. Storage Retr. 10(5\u20136), 189\u2013196 (1974)","journal-title":"Inf. Storage Retr."},{"issue":"2","key":"100_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1108\/17440080680000102","volume":"2","author":"DT Wijaya","year":"2006","unstructured":"Wijaya, D.T., Bressan, S.: Clustering web documents using co-citation, coupling, incoming, and outgoing hyperlinks: a comparative performance analysis of algorithms. IJWIS 2(2), 69\u201376 (2006)","journal-title":"IJWIS"},{"key":"100_CR24","doi-asserted-by":"crossref","unstructured":"Xi, W., Fox, E.A., Fan, W., Zhang, B., Chen, Z., Yan, J., Zhuang, D.: Simfusion: measuring similarity using unified relationship matrix. In: SIGIR (2005)","DOI":"10.1145\/1076034.1076059"},{"key":"100_CR25","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Le, J.: A space and time efficient algorithm for simrank computation. In: APWeb (2010)","DOI":"10.1109\/APWeb.2010.42"},{"key":"100_CR26","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Le, J.: Taming computational complexity: efficient and parallel simrank optimizations on undirected graphs. In: WAIM (2010)","DOI":"10.1007\/978-3-642-14246-8_29"},{"issue":"1","key":"100_CR27","first-page":"718","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB 2(1), 718\u2013729 (2009)","journal-title":"PVLDB"},{"key":"100_CR28","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: CIKM \u201909: Proceeding of the 18th ACM Conference on Information and Knowledge Management (2009)","DOI":"10.1145\/1645953.1646025"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-010-0100-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-010-0100-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-010-0100-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T10:23:01Z","timestamp":1592130181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-010-0100-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,7]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["100"],"URL":"https:\/\/doi.org\/10.1007\/s11280-010-0100-6","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,7]]}}}