{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:03:47Z","timestamp":1750478627733,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11704-016-6168-0","type":"journal-article","created":{"date-parts":[[2017,6,29]],"date-time":"2017-06-29T23:15:30Z","timestamp":1498778130000},"page":"1208-1219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strongly connected components based efficient computation of page rank"],"prefix":"10.1007","volume":"12","author":[{"given":"Hongguo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiezheng","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"key":"6168_CR1","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing","author":"R Mihalcea","year":"2004","unstructured":"Mihalcea R, Tarau P. Textrank: bringing order into texts. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing. 2004"},{"key":"6168_CR2","volume-title":"Stanford University Technical Report","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R, Winograd T. The pagerank citation ranking: bringing order to the web. Stanford University Technical Report. 1999"},{"issue":"8","key":"6168_CR3","doi-asserted-by":"publisher","first-page":"874","DOI":"10.14778\/2757807.2757812","volume":"8","author":"I Mitliagkas","year":"2015","unstructured":"Mitliagkas I, Borokhovich M, Dimakis A G, Caramanis C. Frogwild!: fast pagerank approximations on graph engines. Proceedings of the VLDB Endowment, 2015, 8(8): 874\u2013885","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"6168_CR4","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K Avrachenkov","year":"2005","unstructured":"Avrachenkov K, Litvak N, Nemirovsky D, Osipova N. Monte carlo methods in pagerank computation: when one iteration is sufficient. SIAM Journal on Numerical Analysis, 2005, 45(2): 890\u2013904","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"11","key":"6168_CR5","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.14778\/2809974.2809987","volume":"8","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Liu L, Lee K, Zhang Q. Graph Twist: fast iterative graph computation with two-tier optimizations. Proceedings of the VLDB Endowment, 2015, 8(11): 1262\u20131273","journal-title":"Proceedings of the VLDB Endowment"},{"key":"6168_CR6","first-page":"599","volume-title":"Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation","author":"J E Gonzalez","year":"2014","unstructured":"Gonzalez J E, Xin R S, Dave A, Crankshaw D, Franklin M J, Stoica I. Graphx: graph processing in a distributed dataflow framework. In: Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation. 2014, 599\u2013613"},{"key":"6168_CR7","first-page":"472","volume-title":"Proceedings of the 24th ACM Symposium on Operating Systems Principles","author":"A Roy","year":"2013","unstructured":"Roy A, Mihailovic I, Zwaenepoel W. X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the 24th ACM Symposium on Operating Systems Principles. 2013, 472\u2013488"},{"key":"6168_CR8","volume-title":"Stanford University Technical Report","author":"T Haveliwala","year":"2002","unstructured":"Haveliwala T. Efficient computation of pagerank. Stanford University Technical Report. 2002"},{"key":"6168_CR9","first-page":"505","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"B Shao","year":"2013","unstructured":"Shao B, Wang H X, Li Y T. Trinity: a distributed graph engine on a memory cloud. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2013, 505\u2013516"},{"key":"6168_CR10","first-page":"17","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation","author":"J E Gonzalez","year":"2012","unstructured":"Gonzalez J E, Low Y, Gu H, Bickson D, Guestrin C. Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation. 2012, 17\u201330"},{"key":"6168_CR11","first-page":"29","volume-title":"Proceedings of International Workshop on Innovative Internet Community Systems","author":"M Brinkmeier","year":"2005","unstructured":"Brinkmeier M. Distributed calculation of pagerank using strongly connected components. In: Proceedings of International Workshop on Innovative Internet Community Systems. 2005, 29\u201340"},{"key":"6168_CR12","first-page":"185","volume-title":"Proceedings of the 16th Applied Stochastic Models and Data Analysis International Conference with Demographics 2015 Workshop","author":"C Engstr\u00f6m","year":"2015","unstructured":"Engstr\u00f6m C, Silvestrov S. A componentwise pagerank algorithm. In: Proceedings of the 16th Applied Stochastic Models and Data Analysis International Conference with Demographics 2015 Workshop. 2015, 185\u2013198"},{"issue":"14","key":"6168_CR13","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.14778\/2556549.2556581","volume":"6","author":"W L Xie","year":"2013","unstructured":"Xie W L, Wang G Z, Bindel D, Demers A, Gehrke J. Fast iterative graph computation with block updates. Proceedings of the VLDB Endowment, 2013, 6(14): 2014\u20132025","journal-title":"Proceedings of the VLDB Endowment"},{"key":"6168_CR14","first-page":"31","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation","author":"A Kyr\u00f6l\u00e4","year":"2012","unstructured":"Kyr\u00f6l\u00e4 A, Blelloch G, Guestrin C. Large-scale graph computation on just a PC. In: Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation. 2012, 31\u201346"},{"key":"6168_CR15","first-page":"241","volume-title":"Proceedings of the 28th European Conference on Information Retrieval","author":"C Kohlsch\u00fctter","year":"2006","unstructured":"Kohlsch\u00fctter C, Chirita P A, NejdlW. Efficient parallel computation of pagerank. In: Proceedings of the 28th European Conference on Information Retrieval. 2006, 241\u2013252"},{"key":"6168_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/775152.775190","volume-title":"Proceedings of the 12th International Conference on World Wide Web","author":"S D Kamvar","year":"2003","unstructured":"Kamvar S D, Haveliwala T H, Manning C D, Golub G H. Extrapolation methods for accelerating pagerank computations. In: Proceedings of the 12th International Conference on World Wide Web. 2003, 261\u2013270"},{"key":"6168_CR17","volume-title":"Stanford University Technical Report","author":"S D Kamvar","year":"2003","unstructured":"Kamvar S D, Haveliwala T H, Manning C D, Golub G H. Exploiting the block structure of the web for computing pagerank. Stanford University Technical Report. 2003"},{"issue":"2","key":"6168_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10589-009-9283-0","volume":"46","author":"A L Cust\u00f3dio","year":"2010","unstructured":"Cust\u00f3dio A L, Rocha H, Vicente L N. Incorporating minimum frobenius norm models in direct search. Computational Optimization and Applications, 2010, 46(2): 265\u2013278","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"6168_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(94)90047-7","volume":"49","author":"E Nuutila","year":"1994","unstructured":"Nuutila E, Soisalon-Soininen E. On finding the strongly connected components in a directed graph. Information Processing Letters, 1994, 49(1): 9\u201314","journal-title":"Information Processing Letters"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-016-6168-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-6168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-6168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T14:12:57Z","timestamp":1750428777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-016-6168-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["6168"],"URL":"https:\/\/doi.org\/10.1007\/s11704-016-6168-0","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"type":"print","value":"2095-2228"},{"type":"electronic","value":"2095-2236"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"21 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}