{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:51Z","timestamp":1725570771214},"publisher-location":"Berlin, Heidelberg","reference-count":31,"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_9","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T10:31:28Z","timestamp":1291285888000},"page":"86-97","source":"Crossref","is-referenced-by-count":5,"title":["Finding and Visualizing Graph Clusters Using PageRank Optimization"],"prefix":"10.1007","author":[{"given":"Fan Chung","family":"Graham","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Tsiatas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Barab\u00e1si, A.-L., Jeong, H.: Diameter of the World Wide Web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72504-6_1","volume-title":"Theory and Applications of Models of Computation","author":"R. Andersen","year":"2007","unstructured":"Andersen, R., Chung, F.: Detecting sharp drops in PageRank and a simplified local partitioning algorithm. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 1\u201312. Springer, Heidelberg (2007)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: Proceedings of the 47th Annual IEEE Symposium on Foundation of Computer Science (FOCS 2006), pp. 475\u2013486 (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-44634-6_21","volume-title":"Algorithms and Data Structures","author":"U. Brandes","year":"2001","unstructured":"Brandes, U., Cornelsen, S.: Visual ranking of link structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 222\u2013233. Springer, Heidelberg (2001)"},{"key":"9_CR5","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, 107\u2013117 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A. Broder","year":"2000","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. Computer Networks\u00a033, 1\u20136 (2000)","journal-title":"Computer Networks"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1080\/15427951.2009.10129184","volume":"6","author":"F. Chung","year":"2009","unstructured":"Chung, F., Horn, P., Tsiatas, A.: Distributing antidote using PageRank vectors. Internet Mathematics\u00a06(2), 237\u2013254 (2009)","journal-title":"Internet Mathematics"},{"key":"9_CR8","unstructured":"Chung, F., Zhao, W.: A sharp PageRank algorithm with applications to edge ranking and graph sparsification (Preprint), http:\/\/www.math.ucsd.edu\/~fan\/wp\/sharp.pdf"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M.E. Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.M.: A simple heuristic for the p-centre problem. Operations Research Letters\u00a03(6), 285\u2013288 (1985)","journal-title":"Operations Research Letters"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Eades, P., Feng, Q.: Multilevel visualization of clustered graphs. In: Proceedings of the International Symposium on Graph Drawing, pp. 101\u2013112 (1996)","DOI":"10.1007\/3-540-62495-3_41"},{"issue":"7","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1093\/nar\/30.7.1575","volume":"30","author":"A.J. Enright","year":"2002","unstructured":"Enright, A.J., Van Dongen, S., Ouzounis, C.A.: An efficient algorithm for large-scale detection of protein families. Nucleic Acids Research\u00a030(7), 1575\u20131584 (2002)","journal-title":"Nucleic Acids Research"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM 1999), pp. 251\u2013262 (1999)","DOI":"10.1145\/316188.316229"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313\u2013322 (1986)","DOI":"10.1145\/10515.10549"},{"issue":"11","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"E. Gansner","year":"2000","unstructured":"Gansner, E., North, C.: An open graph visualization system and its applications to software engineering. Software \u2014 Practice and Experience\u00a030(11), 1203\u20131233 (2000)","journal-title":"Software \u2014 Practice and Experience"},{"issue":"12","key":"9_CR15","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s00037-005-0193-y","volume":"14","author":"V. Guruswami","year":"2005","unstructured":"Guruswami, V., Micciancio, D., Regev, O.: The complexity of the covering radius problem on lattices and codes. Computational Complexity\u00a014(2), 90\u2013120 (2005)","journal-title":"Computational Complexity"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36151-0_20","volume-title":"Graph Drawing","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Graph drawing by high-dimensional embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 207\u2013219. Springer, Heidelberg (2002)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Scaling personalized Web search. In: Proceedings of the 12th International Conference on World Wide Web, pp. 271\u2013279 (2003)","DOI":"10.1145\/775152.775191"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters\u00a031(1), 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S. Lloyd","year":"1982","unstructured":"Lloyd, S.: Least square quantization in PCM. IEEE Transactions on Information Theory\u00a028(2), 129\u2013137 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D. Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology\u00a054(4), 396\u2013405 (2003)","journal-title":"Behavioral Ecology and Sociobiology"},{"key":"9_CR22","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Mancoridis, S., Mitchell, B.S., Chen, Y., Gansner, E.R.: Bunch: a clustering tool for the recovery and maintenance of software system structures. In: Proceedings of the IEEE International Conference on Software Maintenance, pp. 50\u201359 (1999)","DOI":"10.1109\/ICSM.1999.792498"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0378-8733(01)00042-9","volume":"23","author":"J. Moody","year":"2001","unstructured":"Moody, J.: Peer influence groups: identifying dense clusters in large networks. Social Networks\u00a023(4), 261\u2013283 (2001)","journal-title":"Social Networks"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M.E.J. Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069, 026113 (2004)","journal-title":"Physical Review E"},{"issue":"2","key":"9_CR26","first-page":"849","volume":"14","author":"A. Ng","year":"2002","unstructured":"Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. Advances in Neural Information Processing Systems\u00a014(2), 849\u2013856 (2002)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"26102","DOI":"10.1103\/PhysRevE.79.026102","volume":"79","author":"A. Noack","year":"2009","unstructured":"Noack, A.: Modularity clustering is force-directed layout. Physical Review E\u00a079, 026102 (2009)","journal-title":"Physical Review E"},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jvlc.1998.0086","volume":"9","author":"G. Parker","year":"1998","unstructured":"Parker, G., Franck, G., Ware, C.: Visualization of large nested graphs in 3D: navigation and interaction. Journal of Visual Languages and Computing\u00a09(3), 299\u2013317 (1998)","journal-title":"Journal of Visual Languages and Computing"},{"key":"9_CR29","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), Article 21 (2007)","DOI":"10.1145\/1255443.1255449"},{"issue":"1","key":"9_CR30","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Computer Science Review\u00a01(1), 27\u201364 (2007)","journal-title":"Computer Science Review"},{"issue":"8","key":"9_CR31","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18009-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:07:29Z","timestamp":1559833649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18009-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642180088","9783642180095"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18009-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}