{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:20:30Z","timestamp":1743049230750,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180088"},{"type":"electronic","value":"9783642180095"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-18009-5_2","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T15:31:28Z","timestamp":1291303888000},"page":"2-14","source":"Crossref","is-referenced-by-count":10,"title":["A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification"],"prefix":"10.1007","author":[{"given":"Fan","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: PODS 2001, pp. 274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Kale, S.: A combinatorial, primal-dual approach to semidefinite programs. In: STOC 2007, pp. 227\u2013236 (2007)","DOI":"10.1145\/1250790.1250823"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS 2006, pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, R., Peres, Y.: Finding sparse cuts locally using evolving sets. In: STOC 2009, pp. 235\u2013244 (2009)","DOI":"10.1145\/1536414.1536449"},{"key":"2_CR5","unstructured":"Arora, S., Hazan, E., Kale, S.: $\\Theta(\\sqrt{\\log n})$ approximation to sparsest cut in $\\tilde{O }(n^2)$ time. In: FOCS 2004, pp. 238\u2013247 (2004)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Batson, J., Spielman, D.A., Srivastava, N.: Twice-Ramanujan sparsifiers. In: STOC 2009, pp. 255\u2013262 (2009)","DOI":"10.1145\/1536414.1536451"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bencz\u00far, A.A., Karger, D.R.: Approximating s-t minimum cuts in $\\tilde{O}(n^2)$ time. In: STOC 1996, pp. 47\u201355 (1996)","DOI":"10.1145\/237814.237827"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/15427951.2006.10129116","volume":"3","author":"P. Berkhin","year":"2007","unstructured":"Berkhin, P.: Bookmark-coloring approach to personalized pagerank computing. Internet Mathematics\u00a03(1), 41\u201362 (2007)","journal-title":"Internet Mathematics"},{"issue":"1-7","key":"2_CR9","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-7), 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"2_CR10","volume-title":"Spectal Graph Theory","author":"F. Chung","year":"1997","unstructured":"Chung, F.: Spectal Graph Theory. AMS Publication, Providence (1997)"},{"issue":"1-2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcta.2000.3094","volume":"91","author":"F. Chung","year":"2000","unstructured":"Chung, F., Yau, S.-T.: Discrete Green\u2019s Functions. Journal of Combinatorial Theory, Series A\u00a091(1-2), 191\u2013214 (2000)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"2_CR12","unstructured":"Green, G.: An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism, Nottingham (1828)"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"H. Haveliwala","year":"2003","unstructured":"Haveliwala, H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng.\u00a015(4), 784\u2013796 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: WWW 2003, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Karger, D.R.: Random sampling in cut, flow, and network design problems. In: STOC 1994, pp. 648\u2013657 (1994)","DOI":"10.1145\/195058.195422"},{"key":"2_CR16","unstructured":"Karger, D.R.: Using randomized sparsification to approximate minimum cuts. In: SODA 1994, pp. 424\u2013432 (1994)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"D.R. Karger","year":"2000","unstructured":"Karger, D.R.: Minimum cuts in near-linear time. JACM\u00a047(1), 46\u201376 (2000)","journal-title":"JACM"},{"key":"2_CR18","first-page":"1","volume":"2","author":"L. Lov\u00e4sz","year":"1993","unstructured":"Lov\u00e4sz, L.: Random walks on graphs: A survey. Combinatorics, Paul Erd\u00f6s is Eighty\u00a02, 1\u201346 (1993)","journal-title":"Combinatorics, Paul Erd\u00f6s is Eighty"},{"key":"2_CR19","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 1990, pp. 346\u2013354 (1990)","DOI":"10.1109\/FSCS.1990.89553"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Orecchia, L., Schulman, L.J., Vazirani, U.V., Vishnoi, N.K.: On partitioning graphs via single commodity flows. In: STOC 2008, pp. 461\u2013470 (2008)","DOI":"10.1145\/1374376.1374442"},{"key":"2_CR21","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":"2_CR22","doi-asserted-by":"crossref","unstructured":"Rudelson, M., Vershynin, R.: Sampling from large matrices: An approach through geometric functional analysis. Journal of the ACM\u00a054(4) (2007)","DOI":"10.1145\/1255443.1255449"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.-H.: Spectral partitioning works: Planar graphs and finite element meshes. In: FOCS 1996, pp. 96\u2013105 (1996)","DOI":"10.1109\/SFCS.1996.548468"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: STOC 2004, pp. 81\u201390 (2004)","DOI":"10.1145\/1007352.1007372"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. In: STOC 2008, pp. 563\u2013568 (2008)","DOI":"10.1145\/1374376.1374456"}],"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-642-18009-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T11:23:56Z","timestamp":1740741836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18009-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642180088","9783642180095"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18009-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}