{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:24Z","timestamp":1760202624243},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_29","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:41:31Z","timestamp":1312879291000},"page":"338-349","source":"Crossref","is-referenced-by-count":5,"title":["Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees"],"prefix":"10.1007","author":[{"given":"Christof","family":"Doll","sequence":"first","affiliation":[]},{"given":"Tanja","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis: Methodological Foundations","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis: Methodological Foundations LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"issue":"2","key":"29_CR2","first-page":"172","volume":"20","author":"U. Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00f6rke, R., H\u00f6fer, M., Nikoloski, Z., Wagner, D.: On Modularity Clustering. IEEE TKDE\u00a020(2), 172\u2013188 (2008)","journal-title":"IEEE TKDE"},{"issue":"4","key":"29_CR3","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":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09(4), 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM Journal on Computing\u00a019(1), 143\u2013155 (1990)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"29_CR6","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.: On Clusterings: Good, Bad and Spectral. JACM\u00a051(3), 497\u2013515 (2004)","journal-title":"JACM"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Saha, B., Mitra, P.: Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. In: Proc. of the 2007 SIAM Int. Conf. on Data Mining, pp. 581\u2013586 (2007)","DOI":"10.1137\/1.9781611972771.65"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-03367-4_30","volume-title":"Algorithms and Data Structures","author":"R. G\u00f6rke","year":"2009","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic Graph Clustering Using Minimum-Cut Trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 339\u2013350. Springer, Heidelberg (2009)"},{"key":"29_CR9","unstructured":"Doll, C.: Hierarchical Cut Clustering in Dynamic Scenarios. Student Research Project, KIT Karlsruhe Institute of Technology, Department of Informatics (February 2011), http:\/\/i11www.iti.uni-karlsruhe.de\/_media\/teaching\/theses\/studienarbeitchristofdoll.pdf"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Doll, C., Hartmann, T., Wagner, D.: Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. Karlsruhe Reports in Informatics 2011-10, KIT Karlsruhe Institute of Technology (2011)","DOI":"10.1007\/978-3-642-22300-6_29"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T18:54:17Z","timestamp":1560452057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}