{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:38:36Z","timestamp":1762429116673},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_30","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"339-350","source":"Crossref","is-referenced-by-count":28,"title":["Dynamic Graph Clustering Using Minimum-Cut Trees"],"prefix":"10.1007","author":[{"given":"Robert","family":"G\u00f6rke","sequence":"first","affiliation":[]},{"given":"Tanja","family":"Hartmann","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","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"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Network Analysis","year":"2005","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)"},{"issue":"4","key":"30_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":"30_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"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Hartmann, T., Wagner, D.: Dynamic Graph Clustering Using Minimum-Cut Trees. Technical report, Informatics, Universit\u00e4t Karlsruhe (2009)","DOI":"10.1007\/978-3-642-03367-4_30"},{"issue":"1","key":"30_CR6","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"},{"key":"30_CR7","unstructured":"Hartmann, T.: Clustering Dynamic Graphs with Guaranteed Quality. Master\u2019s thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (October 2008)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On Clusterings - Good, Bad and Spectral. In: Proc. of FOCS 2000, pp. 367\u2013378 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Saha, B., Mitra, P.: Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. In: Proc. of the, SIAM Int. Conf. on Data Mining, pp. 581\u2013586 (2007)","DOI":"10.1137\/1.9781611972771.65"}],"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-03367-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:28:40Z","timestamp":1558438120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}