{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:53Z","timestamp":1750308773284,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004966","name":"Fifth Framework Programme","doi-asserted-by":"publisher","award":["IST-2001-33555"],"award-info":[{"award-number":["IST-2001-33555"]}],"id":[{"id":"10.13039\/501100004966","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DELIS","award":["1907"],"award-info":[{"award-number":["1907"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BR 2158\/2-3WA 654\/14-3"],"award-info":[{"award-number":["BR 2158\/2-3WA 654\/14-3"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p>A promising approach to graph clustering is based on the intuitive notion of intracluster density versus intercluster sparsity. As for the weighted case, clusters should accumulate lots of weight, in contrast to their connection to the remaining graph, which should be light. While both formalizations and algorithms focusing on particular aspects of this rather vague concept have been proposed, no conclusive argument on their appropriateness has been given. In order to deepen the understanding of particular concepts, including both quality assessment as well as designing new algorithms, we conducted an experimental evaluation of graph-clustering approaches. By combining proved techniques from graph partitioning and geometric clustering, we also introduce a new approach that compares favorably.<\/jats:p>","DOI":"10.1145\/1227161.1227162","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:20:08Z","timestamp":1175800808000},"page":"1-26","source":"Crossref","is-referenced-by-count":34,"title":["Engineering graph clustering"],"prefix":"10.1145","volume":"12","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[{"name":"University of Konstanz"}]},{"given":"Marco","family":"Gaertler","sequence":"additional","affiliation":[{"name":"Universitat Karlsruhe"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[{"name":"Universitat Karlsruhe"}]}],"member":"320","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/554706"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195077"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258675"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"volume-title":"Network Analysis: Methodological Foundations","author":"GAERTLER M.","key":"e_1_2_1_6_1","unstructured":"GAERTLER, M. 2005. Clustering. In Network Analysis: Methodological Foundations, U. Brandes and T. Erlebach, Eds. Lecture Notes in Computer Science, vol. 3418. Springer-Verlag, New York. 178-215."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646839.708660"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00142-3"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/941713.941727"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/42779"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/647683.732515"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875505"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796585"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645722.666392"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223083"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1227161.1227162","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1227161.1227162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:37Z","timestamp":1750278157000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1227161.1227162"}},"subtitle":["Models and experimental evaluation"],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":17,"alternative-id":["10.1145\/1227161.1227162"],"URL":"https:\/\/doi.org\/10.1145\/1227161.1227162","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"type":"print","value":"1084-6654"},{"type":"electronic","value":"1084-6654"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}