{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:11:21Z","timestamp":1743052281543,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":42,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781493998722"},{"type":"electronic","value":"9781493998739"}],"license":[{"start":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T00:00:00Z","timestamp":1570147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-1-4939-9873-9_16","type":"book-chapter","created":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T19:03:11Z","timestamp":1570129391000},"page":"215-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Vienna Graph Clustering"],"prefix":"10.1007","author":[{"given":"Sonja","family":"Biedermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,4]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu L, Tong H, Koutra D (2015) Graph based anomaly detection and description: a survey. Data Min Knowl Disc 29(3):626\u2013688. http:\/\/dx.doi.org\/10.1007\/s10618-014-0365-y","journal-title":"Data Min Knowl Disc"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/bioinformatics\/bti021","volume":"21","author":"V Arnau","year":"2004","unstructured":"Arnau V, Mars S, Mar\u00edn I (2004) Iterative cluster analysis of protein interaction data. Bioinformatics 21(3):364\u2013378","journal-title":"Bioinformatics"},{"key":"16_CR3","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"2012","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (2012) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer Science & Business Media, Berlin"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. PhD thesis","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"key":"16_CR5","unstructured":"Bader D, Meyerhenke H, Sanders P, Wagner D (eds) (2012) Proc. of the 10th DIMACS Impl. Challenge, Cont. Mathematics. AMS, Providence"},{"key":"16_CR6","volume-title":"Evolutionary graph clustering","author":"S Biedermann","year":"2017","unstructured":"Biedermann S (2017) Evolutionary graph clustering. Bachelor\u2019s Thesis, Universit\u00e4t Wien"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Biedermann S, Henzinger M, Schulz C, Schuster B (2018) Memetic graph clustering. In: D\u2019Angelo G (ed) 17th International symposium on experimental algorithms, SEA 2018, June 27\u201329, 2018, L\u2019Aquila, Italy, volume 103 of LIPIcs, pp 3:1\u20133:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.3","DOI":"10.4230\/LIPIcs.SEA.2018.3"},{"issue":"10","key":"16_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):P10008. http:\/\/stacks.iop.org\/1742-5468\/2008\/i=10\/a=P10008","journal-title":"J Stat Mech: Theory Exp"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/b106453","volume-title":"Network analysis: methodological foundations","author":"U Brandes","year":"2005","unstructured":"Brandes U (2005) Network analysis: methodological foundations, vol 3418. Springer Science & Business Media, Berlin"},{"key":"16_CR10","unstructured":"Brandes U, Gaertler M, Wagner D (2007) Engineering graph clustering: models and experimental evaluation. ACM J Exp Algorithmics 12(1.1):1\u201326"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172\u2013188","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Demme J, Sethumadhavan S (2012) Approximate graph clustering for program characterization. ACM Trans Archit Code Optim 8(4):21:1\u201321:21. http:\/\/doi.acm.org\/10.1145\/2086696.2086700","DOI":"10.1145\/2086696.2086700"},{"issue":"16","key":"16_CR13","doi-asserted-by":"publisher","first-page":"160202","DOI":"10.1103\/PhysRevLett.94.160202","volume":"94","author":"I Der\u00e9nyi","year":"2005","unstructured":"Der\u00e9nyi I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94(16):160202","journal-title":"Phys Rev Lett"},{"key":"16_CR14","first-page":"342","volume-title":"Proceedings of the 22th international conference on very large data bases, VLDB \u201996","author":"AA Diwan","year":"1996","unstructured":"Diwan AA, Rane S, Seshadri S, Sudarshan S (1996) Clustering techniques for minimizing external path length. In: Proceedings of the 22th international conference on very large data bases, VLDB \u201996. Morgan Kaufmann Publishers Inc, San Francisco, pp 342\u2013353. http:\/\/dl.acm.org\/citation.cfm?id=645922.673636"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","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","key":"16_CR16","doi-asserted-by":"publisher","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):75\u2013174","journal-title":"Phys Rep"},{"key":"16_CR17","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Boston"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-49487-6_9","volume-title":"Algorithm engineering","author":"T Hartmann","year":"2016","unstructured":"Hartmann T, Kappes A, Wagner D (2016) Clustering evolving networks. In: Algorithm engineering. Springer, Berlin, pp 280\u2013329"},{"key":"16_CR19","unstructured":"Hendrickson B. Chaco: software for partitioning graphs. http:\/\/www.cs.sandia.gov\/~bahendr\/chaco.html"},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A (2004) On clusterings: good, bad and spectral. J ACM 51(3):497\u2013515","journal-title":"J ACM"},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/2001576.2001642","volume-title":"Proceedings of the 13th annual genetic and evolutionary computation conference (GECCO\u201911)","author":"J Kim","year":"2011","unstructured":"Kim J, Hwang I, Kim YH, Moon BR (2011) Genetic approaches for graph partitioning: a survey. In: Proceedings of the 13th annual genetic and evolutionary computation conference (GECCO\u201911). ACM, New York, pp 473\u2013480"},{"key":"16_CR23","first-page":"1","volume-title":"Knowledge discovery in bioinformatics: techniques, methods and application","author":"C Lin","year":"2007","unstructured":"Lin C, Cho Y, Hwang W, Pei P, Zhang A (2007) Clustering methods in protein-protein interaction network. In: Knowledge discovery in bioinformatics: techniques, methods and application. Wiley, New York, pp 1\u201335"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/68182.68200","volume":"17","author":"S McFarling","year":"1989","unstructured":"McFarling S (1989) Program optimization for instruction caches. SIGARCH Comput Archit News 17(2):183\u2013191. http:\/\/doi.acm.org\/10.1145\/68182.68200","journal-title":"SIGARCH Comput Archit News"},{"key":"16_CR25","first-page":"351","volume-title":"SEA, volume 8504 of lecture notes in computer science","author":"H Meyerhenke","year":"2014","unstructured":"Meyerhenke H, Sanders P, Schulz C (2014) Partitioning complex networks via size-constrained clustering. In: SEA, volume 8504 of lecture notes in computer science. Springer, Berlin, pp 351\u2013363"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/evco.1996.4.2.113","volume":"4","author":"BL Miller","year":"1996","unstructured":"Miller BL, Goldberg DE (1996) Genetic algorithms, tournament selection, and the effects of noise. Evol Comput 4(2):113\u2013131","journal-title":"Evol Comput"},{"issue":"2","key":"16_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.026121","volume":"68","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) Properties of highly clustered networks. Phys Rev E 68(2):026121","journal-title":"Phys Rev E"},{"issue":"2","key":"16_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Ovelg\u00f6nne M, Geyer-Schulz A (2013) An ensemble learning strategy for graph clustering. In: Graph partitioning and graph clustering, number 588 in contemporary mathematics. https:\/\/doi.org\/10.1090\/conm\/588\/11701","DOI":"10.1090\/conm\/588\/11701"},{"issue":"1","key":"16_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/prot.10505","volume":"54","author":"JB Pereira-Leal","year":"2004","unstructured":"Pereira-Leal JB, Enright AJ, Ouzounis CA (2004) Detection of functional modules from protein interaction networks. Proteins Struct Funct Bioinformatics 54(1):49\u201357. http:\/\/dx.doi.org\/10.1002\/prot.10505","journal-title":"Proteins Struct Funct Bioinformatics"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Porumbel DC, Hao J-K, Kuntz P (2011) Spacing memetic algorithms. In: 13th Annual genetic and evolutionary computation conference, GECCO 2011, Proceedings, Dublin, Ireland, July 12\u201316, 2011, pp 1061\u20131068","DOI":"10.1145\/2001576.2001720"},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3), 036106","journal-title":"Phys Rev E"},{"issue":"1","key":"16_CR33","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Spec Top 178(1):13\u201323","journal-title":"Eur Phys J Spec Top"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C (2012) Distributed evolutionary graph partitioning. In: Proc. of the 12th workshop on algorithm engineering and experimentation (ALENEX\u201912), pp 16\u201329","DOI":"10.1137\/1.9781611972924.2"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C (2013) Think locally, act globally: highly balanced graph partitioning. In: 12th International symposium on experimental algorithms (SEA\u201913). Springer, Berlin","DOI":"10.1007\/978-3-642-38527-8_16"},{"issue":"1","key":"16_CR36","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE (2007) Survey: graph clustering. Comput Sci Rev 1(1):27\u201364. http:\/\/dx.doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput Sci Rev"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Staudt CL, Meyerhenke H (2013) Engineering high-performance community detection heuristics for massive graphs. In: Proceedings 42nd conference on parallel processing (ICPP\u201913)","DOI":"10.1109\/ICPP.2013.27"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"Staudt CL, Meyerhenke H (2016) Engineering parallel algorithms for community detection in massive networks. IEEE Trans Parallel Distrib Syst 27(1):171\u2013184. doi:10.1109\/TPDS.2015.2390633","DOI":"10.1109\/TPDS.2015.2390633"},{"key":"16_CR39","unstructured":"Van Dongen SM (2001) Graph clustering by flow simulation. PhD thesis"},{"key":"16_CR40","first-page":"744","volume-title":"Proceedings of the 18th international symposium on mathematical foundations of computer science","author":"D Wagner","year":"1993","unstructured":"Wagner D, Wagner F (1993) Between min cut and graph bisection. In: Proceedings of the 18th international symposium on mathematical foundations of computer science. Springer, Berlin, pp 744\u2013750"},{"issue":"3","key":"16_CR41","first-page":"S10","volume":"11","author":"J Wang","year":"2010","unstructured":"Wang J, Li M, Deng Y, Pan Y (2010) Recent advances in clustering methods for protein interaction networks. BMC Genomics 11(3):S10","journal-title":"BMC Genomics"},{"issue":"4","key":"16_CR42","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1093\/bioinformatics\/18.4.536","volume":"18","author":"Y Xu","year":"2002","unstructured":"Xu Y, Olman V, Xu D (2002) Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics 18(4):536\u2013545","journal-title":"Bioinformatics"}],"container-title":["Methods in Molecular Biology","Protein-Protein Interaction Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-9873-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,24]],"date-time":"2021-01-24T02:39:26Z","timestamp":1611455966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-9873-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,4]]},"ISBN":["9781493998722","9781493998739"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-9873-9_16","relation":{},"ISSN":["1064-3745","1940-6029"],"issn-type":[{"type":"print","value":"1064-3745"},{"type":"electronic","value":"1940-6029"}],"subject":[],"published":{"date-parts":[[2019,10,4]]},"assertion":[{"value":"4 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}