{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:59Z","timestamp":1725501119478},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75755-9_108","type":"book-chapter","created":{"date-parts":[[2007,9,22]],"date-time":"2007-09-22T02:44:54Z","timestamp":1190429094000},"page":"908-918","source":"Crossref","is-referenced-by-count":1,"title":["A Web-Site-Based Partitioning Technique for Reducing Preprocessing Overhead of Parallel PageRank Computation"],"prefix":"10.1007","author":[{"given":"Ali","family":"Cevahir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ata","family":"Turk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Barla","family":"Cambazoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"108_CR1","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C. Aykanat","year":"2004","unstructured":"Aykanat, C., Pinar, A., Catalyurek, U.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Scientific Computing\u00a025(6), 1860\u20131879 (2004)","journal-title":"SIAM J. Scientific Computing"},{"key":"108_CR2","unstructured":"Aykanat, C., Cambazoglu, B.B., Ucar, B.: Multilevel hypergraph partitioning with multiple constraints and fixed vertices. J. Parallel and Distributed Computing. (submitted)"},{"issue":"1","key":"108_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P. Berkhin","year":"2005","unstructured":"Berkhin, P.: A survey on PageRank computing. Internet Mathematics\u00a02(1), 73\u2013120 (2005)","journal-title":"Internet Mathematics"},{"key":"108_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/11549970_12","volume-title":"Formal Techniques for Computer Systems and Business Processes","author":"J.T. Bradley","year":"2005","unstructured":"Bradley, J.T., Jager, D.V., Knottenbelt, W.J., Trifunovic, A.: Hypergraph partitioning for faster parallel PageRank computation. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds.) Formal Techniques for Computer Systems and Business Processes. LNCS, vol.\u00a03670, pp. 155\u2013171. Springer, Heidelberg (2005)"},{"key":"108_CR5","first-page":"393","volume":"340","author":"C. Brezinski","year":"2005","unstructured":"Brezinski, C., Redivo-Zaglia, M., Serra Capizzano, S.: Extrapolation methods for PageRank computations. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris, Series I\u00a0340, 393\u2013397 (2005)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris, Series I"},{"key":"108_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0030098","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"U.V. Catalyurek","year":"1996","unstructured":"Catalyurek, U.V., Aykanat, C.: Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. In: Saad, Y., Yang, T., Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1996. LNCS, vol.\u00a01117, pp. 75\u201386. Springer, Heidelberg (1996)"},{"issue":"7","key":"108_CR7","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"U.V. Catalyurek","year":"1999","unstructured":"Catalyurek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems\u00a010(7), 673\u2013693 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"108_CR8","unstructured":"Catalyurek, U.V., Aykanat, C.: A multilevel hypergraph partitioning tool, version 3.0. Tech. Rep., Bilkent University (1999)"},{"key":"108_CR9","unstructured":"Gleich, D., Zhukov, L., Berkhin, P.: Fast parallel PageRank: A linear system approach. Tech. Rep. YRL-2004-038, Yahoo! (2004)"},{"key":"108_CR10","doi-asserted-by":"crossref","unstructured":"Gy\u00f6ngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating Web spam with TrustRank. In: Proc. 30th Int\u2019l Conf. on VLDB, pp. 576\u2013587 (2004)","DOI":"10.1016\/B978-012088469-8.50052-8"},{"key":"108_CR11","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.: Topic sensitive PageRank. In: Proc. 11th Int\u2019l WWW Conf., pp. 517\u2013526 (2002)","DOI":"10.1145\/511446.511513"},{"key":"108_CR12","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1137\/S0895479804439808","volume":"27","author":"I.C.F. Ipsen","year":"2006","unstructured":"Ipsen, I.C.F., Kirkland, S.: Convergence analysis of a PageRank updating algorithm by Langville and Meyer. SIAM J. Matrix Anal. Appl.\u00a027, 952\u2013967 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"108_CR13","doi-asserted-by":"crossref","unstructured":"Ipsen, I.C.F., Selee, T.M.: PageRank computation, with special attention to dangling nodes. SIAM J. Matrix Anal. Appl. (submitted, 2007)","DOI":"10.1137\/060664331"},{"key":"108_CR14","first-page":"191","volume":"34","author":"I.C.F. Ipsen","year":"2006","unstructured":"Ipsen, I.C.F., Wills, R.S.: Mathematical properties and analysis of Google\u2019s PageRank. Bol. Soc. Exp. May. Apl.\u00a034, 191\u2013196 (2006)","journal-title":"Bol. Soc. Exp. May. Apl."},{"key":"108_CR15","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating PageRank computations. In: Proc. 12th Int\u2019l WWW Conf., pp. 261\u2013270 (2003)","DOI":"10.1145\/775152.775190"},{"key":"108_CR16","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Haveliwala, T., Golub, G.: Adaptive methods for computation of PageRank. In: Proc. Int\u2019l Conf. on the Numerical Solution of Markov Chains (2003)","DOI":"10.1016\/j.laa.2003.12.008"},{"key":"108_CR17","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Exploiting the block structure of the Web for computing PageRank. Tech. Rep., Stanford Univ. (2003)"},{"issue":"3","key":"108_CR18","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2005","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics\u00a01(3), 335\u2013380 (2005)","journal-title":"Internet Mathematics"},{"issue":"6","key":"108_CR19","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1137\/040607551","volume":"27","author":"A.N. Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: A reordering for the PageRank problem. SIAM J. Scientific Computing\u00a027(6), 2112\u20132120 (2006)","journal-title":"SIAM J. Scientific Computing"},{"key":"108_CR20","doi-asserted-by":"crossref","unstructured":"Manaskasemsak, B., Rungsawang, A.: Parallel PageRank computation on a gigabit PC cluster. In: Proc. AINA 2004, pp. 273\u2013277 (2004)","DOI":"10.1109\/AINA.2004.1283923"},{"key":"108_CR21","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Tech. Rep. 1999-66, Stanford Univ. (1999)"},{"key":"108_CR22","unstructured":"Ucar, B., Aykanat, C.: A library for parallel sparse matrix-vector multiplies. Tech. Rep. BU-CE-0506, Department of Computer Engineering, Bilkent University, Ankara, Turkey (2005)"},{"issue":"6","key":"108_CR23","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1137\/S1064827502410463","volume":"25","author":"B. Ucar","year":"2004","unstructured":"Ucar, B., Aykanat, C.: Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for matrix-vector multiplies. SIAM J. Scientific Computing.\u00a025(6), 1837\u20131859 (2004)","journal-title":"SIAM J. Scientific Computing."}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75755-9_108.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:30:49Z","timestamp":1619519449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75755-9_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540757542"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75755-9_108","relation":{},"subject":[]}}