{"oa_version":"Published Version","author":[{"full_name":"Biedermann, Sonja","last_name":"Biedermann","first_name":"Sonja"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Schulz","full_name":"Schulz, Christian","first_name":"Christian"},{"last_name":"Schuster","full_name":"Schuster, Bernhard","first_name":"Bernhard"}],"doi":"10.4230/LIPICS.SEA.2018.3","_id":"11911","quality_controlled":"1","volume":103,"scopus_import":"1","day":"01","date_published":"2018-07-01T00:00:00Z","status":"public","title":"Memetic graph clustering","alternative_title":["LIPIcs"],"oa":1,"article_number":"3","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","extern":"1","external_id":{"arxiv":["1802.07034"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.SEA.2018.3"}],"citation":{"apa":"Biedermann, S., Henzinger, M. H., Schulz, C., &#38; Schuster, B. (2018). Memetic graph clustering. In <i>17th International Symposium on Experimental Algorithms</i> (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">https://doi.org/10.4230/LIPICS.SEA.2018.3</a>","chicago":"Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In <i>17th International Symposium on Experimental Algorithms</i>, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">https://doi.org/10.4230/LIPICS.SEA.2018.3</a>.","ieee":"S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in <i>17th International Symposium on Experimental Algorithms</i>, L’Aquila, Italy, 2018, vol. 103.","ista":"Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.","mla":"Biedermann, Sonja, et al. “Memetic Graph Clustering.” <i>17th International Symposium on Experimental Algorithms</i>, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">10.4230/LIPICS.SEA.2018.3</a>.","short":"S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ama":"Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: <i>17th International Symposium on Experimental Algorithms</i>. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.SEA.2018.3\">10.4230/LIPICS.SEA.2018.3</a>"},"abstract":[{"lang":"eng","text":"It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time."}],"date_created":"2022-08-18T06:49:40Z","type":"conference","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959770705"]},"conference":{"location":"L'Aquila, Italy","end_date":"2018-07-29","name":"SEA: Symposium on Experimental Algorithms","start_date":"2018-07-27"},"date_updated":"2023-02-16T11:45:14Z","publication":"17th International Symposium on Experimental Algorithms","year":"2018","language":[{"iso":"eng"}],"month":"07","intvolume":"       103","article_processing_charge":"No"}