{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:08:27Z","timestamp":1776755307797,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540259992","type":"print"},{"value":"9783540320630","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427995_3","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T23:27:06Z","timestamp":1279063626000},"page":"27-36","source":"Crossref","is-referenced-by-count":106,"title":["Efficient Identification of Overlapping Communities"],"prefix":"10.1007","author":[{"given":"Jeffrey","family":"Baumes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Baumes, J., Goldberg, M., Krishnamoorty, M., Magdon-Ismail, M., Preston, N.: Finding communities by clustering a graph into overlapping subgraphs. In: Proceedings of IADIS Applied Computing 2005, February 2005, pp. 97\u2013104 (2005)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Baumes, J., Goldberg, M., Magdon-Ismail, M., Wallace, W.: Discovering hidden groups in communication networks. In: 2nd NSF\/NIJ Symposium on Intelligence and Security Informatics (2004)","DOI":"10.1007\/978-3-540-25952-7_28"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(98)00084-5","volume":"90","author":"J. Berry","year":"1999","unstructured":"Berry, J., Goldberg, M.: Path optimization for graph partitioning problem. Discrete Applied Mathematics\u00a090, 27\u201350 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: Battista, D., Zwick, U. (eds.). LNCS, vol.\u00a0568\u2013579. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"3_CR5","unstructured":"Drineas, P., Kannan, R., Frieze, A., Vempala, S., Vinay, V.: Clustering in large graphs and matrices. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, SODA (1999)"},{"key":"3_CR6","unstructured":"Flake, G.W., Tsioutsiouliklis, K., Tarjan, R.E.: Graph clustering techniques based on minimum cut trees. Technical report, NEC, Princeton, NJ (2002)"},{"key":"3_CR7","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"3_CR9","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 Reviews\u00a045(2), 167\u2013256 (2003)","journal-title":"SIAM Reviews"},{"key":"3_CR10","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. In: Stanford Digital Libraries Working Paper (1998)"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427995_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:55Z","timestamp":1619507395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427995_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259992","9783540320630"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11427995_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}