{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:15:39Z","timestamp":1725549339411},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540234272"},{"type":"electronic","value":"9783540302162"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30216-2_10","type":"book-chapter","created":{"date-parts":[[2010,2,28]],"date-time":"2010-02-28T18:39:11Z","timestamp":1267382351000},"page":"118-130","source":"Crossref","is-referenced-by-count":1,"title":["Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Gianna M.","family":"Del Corso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Gull\u00ed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Romani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: PageRank computation and the structure of the Web: Experiments and algorithms. In: Proc. of the 11th WWW Conf. (2002)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. on Internet Technology (to appear, 2004)","DOI":"10.1145\/1052934.1052938"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: WebGraph framework i: Compression techniques. In: Proc. of the 23th Int. WWW Conf. (2004)","DOI":"10.1145\/988672.988752"},{"issue":"1\u20137","key":"10_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems\u00a030(1\u20137), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the Web. Computer Networks\u00a033, 309\u2013320 (2000)","journal-title":"Computer Networks"},{"key":"10_CR6","unstructured":"Buchsbaum, A.L., Goldwasser, M., Venkatasubramanian, S., Westbrook, J.: On external memory graph traversal. In: SODA, pp. 859\u2013860 (2000)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Gan, Q., Suel, T.: I\/o-efficient techniques for computing Pagerank. In: Proc. of the 11th WWW Conf. (2002)","DOI":"10.1145\/584792.584882"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Cho, J., Roy, S.: Impact of Web search engines on page popularity. In: Proc. of the 13th WWW Conf. (2004)","DOI":"10.1145\/988672.988676"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. 24th Nat. Conf. ACM, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-45467-5_10","volume-title":"Multiphase Flows and Transport in Porous Media: State of the Art","author":"C. Douglas","year":"2000","unstructured":"Douglas, C., Hu, J., Iskandarani, M., Kowarschik, M., R\u00fcde, U., Weiss, C.: Maximizing cache memory usage for multigrid algorithms. In: Multiphase Flows and Transport in Porous Media: State of the Art, pp. 124\u2013137. Springer, Heidelberg (2000)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Eiron, N., McCurley, S., Tomlin, J.A.: Ranking the web frontier. In: Proc. of 13th WWW Conf. (2004)","DOI":"10.1145\/988672.988714"},{"key":"10_CR12","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The John Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"10_CR13","unstructured":"Haveliwala, T.: Efficient computation of PageRank. Technical report, Stanford University (1999)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.: Topic-sensitive PageRank. In: Proc. of the 11th WWW Conf. (2002)","DOI":"10.1145\/511446.511513"},{"key":"10_CR15","unstructured":"Haveliwala, T., Kamvar, S., Jeh, G.: An analytical comparison of approaches to personalizing PageRank. Technical report, Stanford University (2003)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized Web search. In: Proc. of the 12th WWW Conf. (2002)","DOI":"10.1145\/775189.775191"},{"key":"10_CR17","unstructured":"Kamvar, S., Haveliwala, T.: The condition number of the pagerank problem. Technical report, Stanford University (2003)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating PageRank computations. In: Proc. of 12th. WWW Conf. (2003)","DOI":"10.1145\/775152.775190"},{"key":"10_CR19","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C., Golub, G.H.: Exploiting the block structure of the Web for computing PageRank. Technical report, Stanford University (2003)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics (to appear, 2004)","DOI":"10.1080\/15427951.2004.10129091"},{"key":"10_CR21","unstructured":"Lee, C.P., Golub, G.H., Zenios, S.A.: A fast two-stage algorithm for computing PageRank. Technical report, Stanford University (2003)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadthfirst search with sublinear I\/O. In: European Symposium on Algorithms, pp. 723\u2013735 (2002)","DOI":"10.1007\/3-540-45749-6_63"},{"key":"10_CR23","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical report, Stanford (1998)"},{"key":"10_CR24","doi-asserted-by":"crossref","DOI":"10.1515\/9780691223384","volume-title":"Introduction to the Numerical Solution of Markov Chains","author":"W.S. Stewart","year":"1995","unstructured":"Stewart, W.S.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1995)"},{"key":"10_CR25","volume-title":"Matrix Iterative Analysis","author":"R.S. Varga","year":"1962","unstructured":"Varga, R.S.: Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs (1962)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30216-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T13:23:15Z","timestamp":1685452995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30216-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540234272","9783540302162"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30216-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}