{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:36Z","timestamp":1725892596023},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_31","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"287-299","source":"Crossref","is-referenced-by-count":0,"title":["Contracted Webgraphs: Structure Mining and Scale-Freeness"],"prefix":"10.1007","author":[{"given":"Yushi","family":"Uno","sequence":"first","affiliation":[]},{"given":"Fumiya","family":"Oguri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R. Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.-L.: Diameter of the World Wide Web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-45227-0_55","volume-title":"Database and Expert Systems Applications","author":"Y. Asano","year":"2003","unstructured":"Asano, Y., Imai, H., Toyoda, M., Kitsuregawa, M.: Finding neighbor communities in the Web using inter-site graph. In: Ma\u0159\u00edk, V., \u0160t\u011bp\u00e1nkov\u00e1, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol.\u00a02736, pp. 558\u2013568. Springer, Heidelberg (2003)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bharat, K., Chang, B.-W., Henzinger, M., Ruhl, M.: Who links to whom: Mining linkage between web sites. In: Proc. 1st IEEE International Conference on Data Mining, pp. 51\u201358 (2001)","DOI":"10.1109\/ICDM.2001.989500"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Kumar, S.R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. Computer Networks\u00a033, 309\u2013320 (2000)","journal-title":"Computer Networks"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the Web. In: Proc. 16th International WWW Conference, pp. 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proc. 6th ACM International Conference on Knowledge Discovery and Data Mining, pp. 150\u2013160 (2000)","DOI":"10.1145\/347090.347121"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"G.W. Flake","year":"2004","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Internet Mathematics\u00a01, 385\u2013408 (2004)","journal-title":"Internet Mathematics"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-03367-4_30","volume-title":"Algorithms and Data Structures","author":"R. G\u00f6rke","year":"2009","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic graph clustering using minimum-cut trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 339\u2013350. Springer, Heidelberg (2009)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/15427951.2004.10129079","volume":"1","author":"M.R. Henzinger","year":"2003","unstructured":"Henzinger, M.R.: Algorithmic challenges in web search engines. Internet Mathematics\u00a01, 115\u2013126 (2003)","journal-title":"Internet Mathematics"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11561071_13","volume-title":"Algorithms \u2013 ESA 2005","author":"H. Ito","year":"2005","unstructured":"Ito, H., Iwama, K., Osumi, T.: Linear-time enumeration of isolated cliques. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 119\u2013130. Springer, Heidelberg (2005)"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J. Kleinberg","year":"1999","unstructured":"Kleinberg, J.: Authoritative sources in a hyperlinked environment. J. ACM\u00a046, 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume-title":"Computing and Combinatorics","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.S.: The Web as a Graph: Measurements, Models, and Methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 1\u201317. Springer, Heidelberg (1999)"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1126\/science.1067014","volume":"294","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J., Lawrence, S.: The structure of the Web. Science\u00a0294, 1894\u20131895 (2001)","journal-title":"Science"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber-communities. Computer Networks\u00a031, 1481\u20131493 (1999)","journal-title":"Computer Networks"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proc. 17th International WWW Conference, pp. 695\u2013704 (2008)","DOI":"10.1145\/1367497.1367591"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1080\/15427951.2005.10129112","volume":"2","author":"M. Mitzenmacher","year":"2006","unstructured":"Mitzenmacher, M.: Editorial: The future of power law research. Internet Mathematics\u00a02, 525\u2013534 (2006)","journal-title":"Internet Mathematics"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167\u2013256 (2003)","journal-title":"SIAM Review"},{"key":"31_CR18","unstructured":"Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: Proc. 19th International Conference on Data Engineering, pp. 405\u2013416 (2003)"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C. Song","year":"2005","unstructured":"Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature\u00a0433, 392\u2013395 (2005)","journal-title":"Nature"},{"key":"31_CR20","unstructured":"The Stanford WebBase Project, \n                    \n                      http:\/\/www-diglib.stanford.edu\/~testbed\/doc2\/WebBase\/"},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"1998","DOI":"10.1093\/ietisy\/e90-d.12.1998","volume":"E90-D","author":"Y. Uno","year":"2007","unstructured":"Uno, Y., Ota, Y., Uemichi, A.: Web structure mining by isolated cliques. IEICE Transactions on Information and Systems\u00a0E90-D, 1998\u20132006 (2007)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-78808-9_14","volume-title":"Algorithms and Models for the Web-Graph","author":"Y. Uno","year":"2008","unstructured":"Uno, Y., Ota, Y., Uemichi, A.: Web structure mining by isolated stars. In: Aiello, W., Broder, A., Janssen, J., Milios, E.E. (eds.) WAW 2006. LNCS, vol.\u00a04936, pp. 149\u2013156. Springer, Heidelberg (2008)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u2018small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T22:44:42Z","timestamp":1553726682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}