{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:30:01Z","timestamp":1742401801783},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204367"},{"type":"electronic","value":"9783540398844"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39884-4_3","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T20:50:29Z","timestamp":1283547029000},"page":"20-35","source":"Crossref","is-referenced-by-count":6,"title":["Communities in Graphs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Brinkmeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"R. Albert","year":"1999","unstructured":"Albert, R., Barab\u00e0si, A.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0378-4371(00)00018-2","volume":"281","author":"R. Albert","year":"2000","unstructured":"Albert, R., Barab\u00e0si, A., Jeong, H.: Scale-free characteristics of random network: The topology of the world wide web. Physica A\u00a0281, 69\u201377 (2000)","journal-title":"Physica A"},{"key":"3_CR3","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.: Diameter of the world-wide web. Nature\u00a0401, 130\u2013131 (1999)","journal-title":"Nature"},{"doi-asserted-by":"crossref","unstructured":"Bharat, K., Henzinger, M.R.: Improved algorithms for topic distillation in a hyperlinked environment. In: Proceedings of SIGIR 1998, 21st ACM International Conference on Research and Development in Information Retrieval, Melbourne, AU, pp. 104\u2013111 (1998)","key":"3_CR4","DOI":"10.1145\/290941.290972"},{"doi-asserted-by":"crossref","unstructured":"Botafogo, R.A.: Cluster analysis for hypertext systems. In: Proc. of the 16-th Annual ACM SIGIR Conference of Res. and Dev. in Info. Retrieval, pp. 116\u2013125 (1993)","key":"3_CR5","DOI":"10.1145\/160688.160704"},{"doi-asserted-by":"crossref","unstructured":"Borodin, A., Roberts, G.O., Rosenthal, J.S., Tsaparas, P.: Finding authorities and hubs from link structures on the world wide web. World Wide Web, 415\u2013429 (2001)","key":"3_CR6","DOI":"10.1145\/371920.372096"},{"doi-asserted-by":"crossref","unstructured":"Botafogo, R.A., Shneiderman, B.: Identifying aggregates in hypertext structures. In: UK Conference on Hypertext, pp. 63\u201374 (1991)","key":"3_CR7","DOI":"10.1145\/122974.122981"},{"unstructured":"Brinkmeier, M.: Communities in Graphs. Technical Report. Downloadable at, http:\/\/citeseer.nj.nec.com\/brinkmeier02communities.html","key":"3_CR8"},{"issue":"8","key":"3_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/2.781636","volume":"32","author":"S. Chakrabarti","year":"1999","unstructured":"Chakrabarti, S., Dom, B.E., Ravi Kumar, S., Raghavan, P., Rajagopalan, S., Tomkins, A., Gibson, D., Kleinberg, J.: Mining the Web\u2019s link structure. Computer\u00a032(8), 60\u201367 (1999)","journal-title":"Computer"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0030816","volume-title":"Computing and Combinatorics","author":"Q. Feng","year":"1995","unstructured":"Feng, Q., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 21\u201331. Springer, Heidelberg (1995)"},{"unstructured":"Feng, Q.: Algorithms for Drawing Clustered Graphs. PhD thesis, Department of Computer Science and Software Engineering, University of Newcastle (1997)","key":"3_CR11"},{"doi-asserted-by":"crossref","unstructured":"Flake, G., Lawrence, S., Lee Giles, C.: Efficient identification of web communities. In: Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, August 20-23, pp. 150\u2013160 (2000)","key":"3_CR12","DOI":"10.1145\/347090.347121"},{"doi-asserted-by":"crossref","unstructured":"Gibson, D., Kleinberg, J.M., Raghavan, P.: Inferring web communities from link topology. In: UK Conference on Hypertext, pp. 225\u2013234 (1998)","key":"3_CR13","DOI":"10.1145\/276627.276652"},{"issue":"4-6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E. Hartuv","year":"2000","unstructured":"Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Information Processing Letters\u00a076(4-6), 175\u2013181 (2000)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Hartuv, E., Schmitt, A., Lange, J., Meier-Ewert, S., Lehrachs, H., Shamir, R.: An algorithm for clustering cDNAs for gene expression analysis. In: RECOMB, pp. 188\u2013197 (1999)","key":"3_CR15","DOI":"10.1145\/299432.299483"},{"unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (1998)","key":"3_CR16"},{"issue":"11-16","key":"3_CR17","first-page":"1481","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 (Amsterdam, Netherlands: 1999)\u00a031(11-16), 1481\u20131493 (1999)","journal-title":"Computer Networks (Amsterdam, Netherlands: 1999)"},{"unstructured":"Litow, B.: A review of world wide web searching techniques, focusing on hits and related algorithms that utilise the link topology of the world wide web to provide the basis for a structure based search technology","key":"3_CR18"},{"key":"3_CR19","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BFb0060120","volume-title":"The Many Facets of Graph Theory","author":"D.W. Matula","year":"1969","unstructured":"Matula, D.W.: The cohesive strength of graphs. In: Chartrand, G., Kapoor, S.F. (eds.) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol.\u00a0110, pp. 215\u2013221. Springer, Heidelberg (1969)"},{"issue":"3","key":"3_CR20","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/0122040","volume":"22","author":"D.W. Matula","year":"1972","unstructured":"Matula, D.W.: k-components, clusters, and slicings in graphs. SIAM J. Appl. Math.\u00a022(3), 459\u2013480 (1972)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs. SIAM J. Disc. Math.\u00a05(1), 54\u201366 (1992)","journal-title":"SIAM J. Disc. Math."},{"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":"3_CR22"}],"container-title":["Lecture Notes in Computer Science","Innovative Internet Community Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39884-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T09:14:56Z","timestamp":1559553296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39884-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204367","9783540398844"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39884-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}