{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:41:25Z","timestamp":1648658485243},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,9]],"date-time":"2013-02-09T00:00:00Z","timestamp":1360368000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00287-013-0685-0","type":"journal-article","created":{"date-parts":[[2013,2,9]],"date-time":"2013-02-09T02:42:25Z","timestamp":1360377745000},"page":"144-152","source":"Crossref","is-referenced-by-count":0,"title":["Identifikation von Clustern in Graphen"],"prefix":"10.1007","volume":"36","author":[{"given":"Robert","family":"G\u00f6rke","sequence":"first","affiliation":[]},{"given":"Tanja","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Kappes","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,9]]},"reference":[{"key":"685_CR1","unstructured":"Bader DA, Meyerhenke H, Sanders P, Schulz C, Schumm A, Wagner D (2012) A benchmarking set for graph clustering and partitioning. In: Rokne J, Alhajj R (eds) Encyclopedia of Social Network Analysis and Mining. Springer, to appear"},{"issue":"2","key":"685_CR2","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes U, Delling D, Gaertler M, G\u00f6rke R, H\u00f6fer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE T Knowl Data En 20(2):172\u2013188","journal-title":"IEEE T Knowl Data En"},{"key":"685_CR3","doi-asserted-by":"crossref","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70(066111), online article","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"685_CR4","doi-asserted-by":"crossref","unstructured":"de Montgolfier F, Soto M, Viennot L (2011) Asymptotic modularity of some graph classes. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC\u201911), Lecture Notes in Computer Science, vol 7074, Springer, pp 435\u2013444","DOI":"10.1007\/978-3-642-25591-5_45"},{"key":"685_CR5","doi-asserted-by":"crossref","unstructured":"Delling D, Gaertler M, G\u00f6rke R, Wagner D (2008) Engineering comparators for graph clusterings. In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM\u201908), Lecture Notes in Computer Science, vol 5034, Springer, pp 131\u2013142","DOI":"10.1007\/978-3-540-68880-8_14"},{"issue":"4","key":"685_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/15427951.2004.10129093","volume":"1","author":"GW Flake","year":"2004","unstructured":"Flake GW, Tarjan RE, Tsioutsiouliklis K (2004) Graph clustering and minimum cut trees. Internet Math 1(4):385\u2013408","journal-title":"Internet Math"},{"issue":"3\u20135","key":"685_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"issue":"4","key":"685_CR8","first-page":"551","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory RE, Hu TC (1961) Multi-terminal network flows. Internet Math 9(4):551\u2013570","journal-title":"Internet Math"},{"key":"685_CR9","unstructured":"G\u00f6rke R (2010) An Algorithmic Walk from Static to Dynamic Graph Clustering. PhD thesis, Department of Informatics, Karlsruhe Institute of Technology, Karlsruhe, February"},{"key":"685_CR10","doi-asserted-by":"crossref","unstructured":"G\u00f6rke R, Schumm A, Wagner D (2011) Density-constrained graph clustering. In: Proceedings of the 12th International Symposium on Algorithms and Data Structures (WADS\u201911), Lecture Notes in Computer Science, vol 6844, Springer, pp 679\u2013690","DOI":"10.1007\/978-3-642-22300-6_58"},{"key":"685_CR11","doi-asserted-by":"crossref","unstructured":"G\u00f6rke R, Schumm A, Wagner D (2012) Experiments on density-constrained graph clustering. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX\u201912), SIAM, 2012, 1\u201315","DOI":"10.1137\/1.9781611972924.1"},{"key":"685_CR12","doi-asserted-by":"crossref","unstructured":"Guimer\u00e0 R, Sales-Pardo M, Nunes Amaral LA (2004) Modularity from fluctuations in random graphs and complex networks. Phys Rev E 70(025101), online article","DOI":"10.1103\/PhysRevE.70.025101"},{"issue":"026113","key":"685_CR13","first-page":"1","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(026113):1\u201316","journal-title":"Phys Rev E"},{"key":"685_CR14","doi-asserted-by":"crossref","unstructured":"Ovelg\u00f6nne M, Geyer-Schulz A (2010) Cluster cores and modularity maximization. In: 2010 IEEE International Conference on Data Mining Workshops (ICDMW), December 2010, IEEE Computer Society, pp 1204\u20131213","DOI":"10.1109\/ICDMW.2010.63"},{"key":"685_CR15","doi-asserted-by":"crossref","first-page":"2.3:2.1","DOI":"10.1145\/1963190.1970376","volume":"16","author":"R Rotta","year":"2011","unstructured":"Rotta R, Noack A (2011) Multilevel local search algorithms for modularity clustering. ACM J Exper Algorithm 16:2.3:2.1\u20132.3:2","journal-title":"ACM J Exper Algorithm"},{"issue":"3\u20135","key":"685_CR16","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(3\u20135):452\u2013473","journal-title":"J Anthropol Res"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0685-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-013-0685-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0685-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T05:15:32Z","timestamp":1644297332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-013-0685-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["685"],"URL":"https:\/\/doi.org\/10.1007\/s00287-013-0685-0","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,9]]}}}