{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T22:31:36Z","timestamp":1778193096034,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540770039","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77004-6_13","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T06:40:36Z","timestamp":1195022436000},"page":"166-178","source":"Crossref","is-referenced-by-count":21,"title":["Local Partitioning for Directed Graphs Using PageRank"],"prefix":"10.1007","author":[{"given":"Reid","family":"Andersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1109\/FOCS.2006.44","volume-title":"FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"R. Andersen","year":"2006","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475\u2013486. IEEE Computer Society, Washington, DC (2006)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1080\/15427951.2006.10129116","volume":"3","author":"P. Berkhin","year":"2006","unstructured":"Berkhin, P.: Bookmark-coloring algorithm for personalized PageRank computing. Internet Math.\u00a03(1), 41\u201362 (2006)","journal-title":"Internet Math."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1109557.1109564","volume-title":"SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm","author":"M. Charikar","year":"2006","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Directed metrics and directed graph partitioning problems. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 51\u201360. ACM Press, New York (2006)"},{"key":"13_CR4","volume-title":"CBMS Regional Conference Series in Mathematics","author":"F. Chung","year":"1997","unstructured":"Chung, F.: Spectral graph theory. In: CBMS Regional Conference Series in Mathematics, vol.\u00a092, American Mathematical Society, Providence (1997)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F. Chung","year":"2005","unstructured":"Chung, F.: Laplacians and Cheeger inequalities for directed graphs. Annals of Combinatorics\u00a09, 1\u201319 (2005)","journal-title":"Annals of Combinatorics"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/1132516.1132593","volume-title":"STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing","author":"J. Chuzhoy","year":"2006","unstructured":"Chuzhoy, J., Khanna, S.: Hardness of cut problems in directed graphs. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 527\u2013536. ACM Press, New York (2006)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1214\/aoap\/1177005981","volume":"1","author":"J.A. Fill","year":"1991","unstructured":"Fill, J.A.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab.\u00a01(1), 62\u201387 (1991)","journal-title":"Ann. Appl. Probab."},{"key":"13_CR8","unstructured":"Gleich, D., Polito, M.: Approximating personalized PageRank with minimal use of webgraph data. Internet Mathematics (to appear)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Golub, G., Greif, C.: Arnoldi-type algorithms for computing stationary distribution vectors, with application to PageRank. 10543 BIT Numerical Mathematics\u00a046(4) (2006)","DOI":"10.1007\/s10543-006-0091-y"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW 2003. Proceedings of the 12th World Wide Web Conference, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Simonovits, M.: The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In: FOCS, pp. 346\u2013354 (1990)","DOI":"10.1109\/FSCS.1990.89553"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Mihail, M.: Conductance and convergence of markov chains\u2014a combinatorial treatment of expanders. In: Proc. of 30th FOCS, pp. 526\u2013531 (1989)","DOI":"10.1109\/SFCS.1989.63529"},{"key":"13_CR13","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project (1998)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T., Bencz\u00far, A.A., Csalog\u00e1ny, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297\u2013306 (2006)","DOI":"10.1145\/1135777.1135823"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.-H.: Spectral partitioning works: Planar graphs and finite element meshes. In: IEEE Symposium on Foundations of Computer Science, pp. 96\u2013105 (1996)","DOI":"10.1109\/SFCS.1996.548468"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton Univ. Press (1994)","DOI":"10.1515\/9780691223384"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77004-6_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T09:28:52Z","timestamp":1737538132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77004-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770039"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77004-6_13","relation":{},"subject":[]}}