{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:23:07Z","timestamp":1742394187155},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287018"},{"type":"electronic","value":"9783540319030"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549970_12","type":"book-chapter","created":{"date-parts":[[2005,11,11]],"date-time":"2005-11-11T12:53:44Z","timestamp":1131713624000},"page":"155-171","source":"Crossref","is-referenced-by-count":20,"title":["Hypergraph Partitioning for Faster Parallel PageRank Computation"],"prefix":"10.1007","author":[{"given":"Jeremy T.","family":"Bradley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas V.","family":"de Jager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William J.","family":"Knottenbelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Trifunovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Wolff, R.: Stochastic Modeling and the Theory of Queues. Prentice-Hall International Editions, Englewood Cliffs (1989)"},{"issue":"4","key":"12_CR2","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"T.H. Haveliwala","year":"2003","unstructured":"Haveliwala, T.H.: Topic sensitive PageRank: A context-sensitive ranking algorithm for web search. Tech. Rep., Stanford University (March 2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1\u20132","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C. Alpert","year":"1995","unstructured":"Alpert, C., Huang, J.-H., Kahng, A.: Recent Directions in Netlist Partitioning. Integration, the VLSI Journal\u00a019(1\u20132), 1\u201381 (1995)","journal-title":"Integration, the VLSI Journal"},{"issue":"7","key":"12_CR4","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\u2013vector multiplication. IEEE Transactions on Parallel and Distributed Systems\u00a010(7), 673\u2013693 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0036144502409019","volume":"47","author":"B. Vastenhouw","year":"2005","unstructured":"Vastenhouw, B., Bisseling, R.H.: A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication. SIAM Review\u00a047(1), 67\u201395 (2005)","journal-title":"SIAM Review"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-30182-0_79","volume-title":"Computer and Information Sciences - ISCIS 2004","author":"A. Trifunovic","year":"2004","unstructured":"Trifunovic, A., Knottenbelt, W.J.: Parkway2.0: A Parallel Multilevel Hypergraph Partitioning Tool. In: Aykanat, C., Dayar, T., K\u00f6rpeo\u011flu, \u0130. (eds.) ISCIS 2004. LNCS, vol.\u00a03280, pp. 789\u2013800. Springer, Heidelberg (2004)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Boman, E., Devine, K., Heaphy, R., Catalyurek, U., Bisseling, R.: Parallel hypergraph partitioning for scientific computing. Tech. Rep. SAND05\u20132796C, Sandia National Laboratories, Albuquerque, NM (April 2005)","DOI":"10.1109\/IPDPS.2006.1639359"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/775152.775190","volume-title":"Twelfth International World Wide Web Conference","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: Twelfth International World Wide Web Conference, Budapest, Hungary, May 2003, pp. 261\u2013270. ACM, New York (2003)"},{"key":"12_CR9","unstructured":"de Jager, D.: PageRank: Three distributed algorithms. M.Sc. thesis, Department of Computing, Imperial College London, London SW7 2BZ, UK (September 2004)"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2004","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Mathematics\u00a01(3), 335\u2013400 (2004)","journal-title":"Internet Mathematics"},{"key":"12_CR11","unstructured":"Haveliwala, T.H., Kamvar, S.D.: The second eigenvalue of the google matrix. Tech. Rep., Computational Mathematics, Stanford University (March 2003)"},{"key":"12_CR12","unstructured":"Google (June 20, 2005), http:\/\/www.google.com\/"},{"key":"12_CR13","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the block structure of the web for computing PageRank. In: Stanford database group tech. rep., Computational Mathematics, March 2003, Stanford University (2003)"},{"key":"12_CR14","unstructured":"Gleich, D., Zhukov, L., Berkhin, P.: Fast parallel PageRank: A linear system approach. Tech. Rep., Institute for Computation and Mathematical Engineering, Stanford University (2004)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Catalyurek, U.V., Aykanat, C.: A Fine-Grain Hypergraph Model for 2D Decomposition of Sparse Matrices. In: Proc. 8th International Workshop on Solving Irregularly Structured Problems in Parallel, San Francisco, USA (April 2001)","DOI":"10.1109\/IPDPS.2001.925093"},{"issue":"6","key":"12_CR16","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 Parallel Matrix-Vector Multiples. SIAM Journal of Scientific Computing\u00a025(6), 1837\u20131859 (2004)","journal-title":"SIAM Journal of Scientific Computing"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BFb0018541","volume-title":"Solving Irregularly Structured Problems in Parallel","author":"B.A. Hendrickson","year":"1998","unstructured":"Hendrickson, B.A.: Graph partitioning and parallel solvers: Has the Emperor no clothes. In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol.\u00a01457, pp. 218\u2013225. Springer, Heidelberg (1998)"},{"key":"12_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"12_CR19","first-page":"114","volume-title":"Proc. 3rd International Symposium on Parallel and Distributed Computing","author":"A. Trifunovic","year":"2004","unstructured":"Trifunovic, A., Knottenbelt, W.: A Parallel Algorithm for Multilevel k-way Hypergraph Partitioning. In: Proc. 3rd International Symposium on Parallel and Distributed Computing, July 2004, pp. 114\u2013121. University College Cork, Ireland (2004)"},{"key":"12_CR20","unstructured":"Davis, T.: University of Florida Sparse Matrix Collection (March 2005), http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices"},{"key":"12_CR21","unstructured":"UbiCrawler project, http:\/\/webgraph-data.dsi.unimi.it\/"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Computer Systems and Business Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549970_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:12:01Z","timestamp":1586549521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549970_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287018","9783540319030"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11549970_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}