{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:02:23Z","timestamp":1746316943340},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_28","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"309-320","source":"Crossref","is-referenced-by-count":28,"title":["Energy-Based Clustering of Graphs with Nonuniform Degrees"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Noack","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics\u00a074(1), 47\u201397 (2002)","journal-title":"Reviews of Modern Physics"},{"issue":"1-2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal\u00a019(1-2), 1\u201381 (1995)","journal-title":"Integration, the VLSI Journal"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J. Barnes","year":"1986","unstructured":"Barnes, J., Hut, P.: A hierarchical O(N log N) force-calculation algorithm. Nature\u00a0324, 446\u2013449 (1986)","journal-title":"Nature"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/BFb0021789","volume-title":"Graph Drawing","author":"J. Blythe","year":"1996","unstructured":"Blythe, J., McGrath, C., Krackhardt, D.: The effect of graph layout on inference from social network data. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 40\u201351. Springer, Heidelberg (1996)"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Transactions on Graphics"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-37623-2_37","volume-title":"Graph Drawing","author":"E. Dengler","year":"1999","unstructured":"Dengler, E., Cowan, W.: Human perception of laid-out graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 441\u2013443. Springer, Heidelberg (1999)"},{"key":"28_CR7","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"issue":"11","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software \u2013 Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software \u2013 Practice and Experience"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44541-2_20","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 211\u2013221. Springer, Heidelberg (2001)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S. Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K.M. Hall","year":"1970","unstructured":"Hall, K.M.: An r-dimensional quadratic placement algorithm. Management Science\u00a017(3), 219\u2013229 (1970)","journal-title":"Management Science"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-44541-2_18","volume-title":"Graph Drawing","author":"D. Harel","year":"2001","unstructured":"Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 183\u2013196. Springer, Heidelberg (2001)"},{"issue":"1","key":"28_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters\u00a031(1), 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"issue":"3","key":"28_CR14","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. Journal of the ACM\u00a051(3), 497\u2013515 (2004)","journal-title":"Journal of the ACM"},{"key":"28_CR15","first-page":"422","volume-title":"Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS 1988)","author":"T. Leighton","year":"1988","unstructured":"Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), pp. 422\u2013431. IEEE, Los Alamitos (1988)"},{"key":"28_CR16","first-page":"45","volume-title":"Proc. 6th IEEE International Workshop on Program Comprehension (IWPC 1998)","author":"S. Mancoridis","year":"1998","unstructured":"Mancoridis, S., Mitchell, B.S., Rorres, C., Chen, Y., Gansner, E.R.: Using automatic clustering to produce high-level system organizations of source code. In: Proc. 6th IEEE International Workshop on Program Comprehension (IWPC 1998), pp. 45\u201352. IEEE, Los Alamitos (1998)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-24595-7_40","volume-title":"Graph Drawing","author":"A. Noack","year":"2004","unstructured":"Noack, A.: An energy model for visual graph clustering. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 425\u2013436. Springer, Heidelberg (2004)"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/1056018.1056040","volume-title":"Proc. 2nd ACM Symposium on Software Visualization (SoftVis 2005)","author":"A. Noack","year":"2005","unstructured":"Noack, A., Lewerentz, C.: A space of layout styles for hierarchical graph models of software systems. In: Proc. 2nd ACM Symposium on Software Visualization (SoftVis 2005), pp. 155\u2013164. ACM, New York (2005)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph Drawing","author":"A.J. Quigley","year":"2001","unstructured":"Quigley, A.J., Eades, P.: FADE: Graph drawing, clustering, and visual abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 197\u2013210. Springer, Heidelberg (2001)"},{"issue":"8","key":"28_CR20","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume-title":"Graph Drawing","author":"C. Walshaw","year":"2001","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 171\u2013182. Springer, Heidelberg (2001)"},{"issue":"11","key":"28_CR22","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z. Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence\u00a015(11), 1101\u20131113 (1993)","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:15Z","timestamp":1619507535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11618058_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}