{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:47:01Z","timestamp":1749804421778},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300448"},{"type":"electronic","value":"9783642300455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30045-5_5","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T00:33:29Z","timestamp":1337042009000},"page":"56-67","source":"Crossref","is-referenced-by-count":8,"title":["Crawling and Detecting Community Structure in Online Social Networks Using Local Information"],"prefix":"10.1007","author":[{"given":"Norbert","family":"Blenn","sequence":"first","affiliation":[]},{"given":"Christian","family":"Doerr","sequence":"additional","affiliation":[]},{"given":"Bas","family":"Van Kester","sequence":"additional","affiliation":[]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E\u00a070 (December 2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Trajanovski, S., Wang, H., Van Mieghem, P.: Maximum Modular Graphs. European Physics Journal B (2011) (submitted)","DOI":"10.1140\/epjb\/e2012-20898-3"},{"key":"5_CR3","unstructured":"Cormen, T.: Introduction to algorithms. MIT electrical engineering and computer science series. MIT Press (2001)"},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1086\/229693","volume":"96","author":"S.L. Feld","year":"1991","unstructured":"Feld, S.L.: Why Your Friends Have More Friends Than You Do. American Journal of Sociology\u00a096(6), 1464\u20131477 (1991)","journal-title":"American Journal of Sociology"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Kurant, M., Markopoulou, A., Thiran, P.: On the bias of BFS (Breadth First Search). In: 22nd International Teletraffic Congress (ITC), pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/ITC.2010.5608727"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11569596_31","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"P. Pons","year":"2005","unstructured":"Pons, P., Latapy, M.: Computing Communities in Large Networks Using Random Walks. In: Yolum, p., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 284\u2013293. Springer, Heidelberg (2005)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"66118","DOI":"10.1103\/PhysRevE.81.066118","volume":"81","author":"D. Lai","year":"2010","unstructured":"Lai, D., Lu, H., Nardini, C.: Enhanced modularity-based community detection by random walk network preprocessing. Phys. Rev. E\u00a081, 066118 (2010)","journal-title":"Phys. Rev. E"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E Stat. Nonlin. Soft. Matter Phys.\u00a074 (July 2006)","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"5_CR9","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, 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"5_CR10","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. Phys. Rev. E\u00a069, 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E\u00a076, 036106+ (2007)","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, N., Dinh, T., Xuan, Y., Thai, M.: Adaptive algorithms for detecting community structure in dynamic social networks. In: 2011 Proceedings IEEE INFOCOM, pp. 2282\u20132290 (April 2011)","DOI":"10.1109\/INFCOM.2011.5935045"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of community hierarchies in large networks. CoRR, abs\/0803.0476 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"5_CR14","unstructured":"Fortunato, S., Castellano, C.: Community structure in graphs (2007)"},{"key":"5_CR15","unstructured":"Van Kester, S.: Efficient Crawling of Community Structures in Online Social Networks. PVM 2011-071, Tu Delft (September 2011)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Zachary, W.W.: An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research\u00a033(4) (1977)","DOI":"10.1086\/jar.33.4.3629752"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TMM.2011.2159706","volume":"13","author":"S. Tang","year":"2011","unstructured":"Tang, S., Blenn, N., Doerr, C., Van Mieghem, P.: Digging in the Digg Social News Website. IEEE Transactions on Multimedia\u00a013, 1163\u20131175 (2011)","journal-title":"IEEE Transactions on Multimedia"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S. Fortunato","year":"2007","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proceedings of the National Academy of Sciences\u00a0104, 36\u201341 (2007)","journal-title":"Proceedings of the National Academy of Sciences"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30045-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T07:16:09Z","timestamp":1556781369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30045-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300448","9783642300455"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30045-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}