{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T12:40:04Z","timestamp":1741437604252,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"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-22300-6_58","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"679-690","source":"Crossref","is-referenced-by-count":3,"title":["Density-Constrained Graph Clustering"],"prefix":"10.1007","author":[{"given":"Robert","family":"G\u00f6rke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schumm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","volume-title":"Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"2002","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A.: Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties, 2nd edn. Springer, Heidelberg (2002)","edition":"2"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-28349-8_2","volume-title":"Grouping Multidimensional Data: Recent Advances in Clustering","author":"P. Berkhin","year":"2006","unstructured":"Berkhin, P.: A Survey of Clustering Data Mining Techniques. In: Grouping Multidimensional Data: Recent Advances in Clustering, pp. 25\u201371. Springer, Heidelberg (2006)"},{"key":"58_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1227161.1227162","volume":"12","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Gaertler, M., Wagner, D.: Engineering Graph Clustering: Models and Experimental Evaluation. ACM J. of Exp. Algorithmics\u00a012(1.1), 1\u201326 (2007)","journal-title":"ACM J. of Exp. Algorithmics"},{"key":"58_CR4","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.endm.2007.07.065","volume":"29","author":"F. Chataigner","year":"2007","unstructured":"Chataigner, F., Manic, G., Wakabayashi, Y., Yuster, R.: Approximation algorithms and hardness results for the clique packing problem. Electronic Notes in Discrete Mathematics\u00a029, 397\u2013401 (2007)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E\u00a070(066111) (2004)","DOI":"10.1103\/PhysRevE.70.066111"},{"issue":"4","key":"58_CR6","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(4), 385\u2013408 (2004)","journal-title":"Internet Mathematics"},{"issue":"3-5","key":"58_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S. Fortunato","year":"2009","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep.\u00a0486(3-5), 75\u2013174 (2009)","journal-title":"Phys. Rep."},{"key":"58_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of $\\mathcal{NP}$ -Completeness. W. H.\u00a0Freeman and Company, New York (1979)"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Schumm, A., Wagner, D.: Density-Constrained Graph Clustering. Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), Karlsruhe Reports in Informatics 2011-2017 (2011)","DOI":"10.1007\/978-3-642-22300-6_58"},{"key":"58_CR10","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":"58_CR11","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On Clusterings - Good, Bad and Spectral. In: Proc. of FOCS 2000, pp. 367\u2013378 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"key":"58_CR12","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069(026113) (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"58_CR13","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W.W. Zachary","year":"1977","unstructured":"Zachary, W.W.: An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research\u00a033, 452\u2013473 (1977)","journal-title":"Journal of Anthropological Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T12:05:45Z","timestamp":1741435545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}