{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:53Z","timestamp":1725514433650},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_1","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"1-12","source":"Crossref","is-referenced-by-count":19,"title":["Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm"],"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"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: Proc. 47th Annual Symposium on Foundations of Computer Science (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"1_CR2","unstructured":"Berkhin, P.: Bookmark-Coloring Approach to Personalized PageRank Computing. Internet Mathematics, to appear."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 107\u2013117 (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-540-30216-2_9","volume-title":"Algorithms and Models for the Web-Graph","author":"D. Fogaras","year":"2004","unstructured":"Fogaras, D., R\u00e1cz, B.: Towards Scaling Fully Personalized PageRank. In: Leonardi, S. (ed.) WAW 2004. LNCS, vol.\u00a03243, pp. 105\u2013117. Springer, Heidelberg (2004)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search. IEEE Trans. Knowl. Data Eng., 784\u2013796 (2003)","DOI":"10.1109\/TKDE.2003.1208999"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of the 12th World Wide Web Conference (WWW), pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"key":"1_CR7","unstructured":"Page, L., et al.: The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Library Technologies Project (1998)"},{"key":"1_CR8","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: ACM STOC, pp. 81\u201390 (2004)","DOI":"10.1145\/1007352.1007372"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:38:02Z","timestamp":1619501882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_1","relation":{},"subject":[]}}