{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:21:24Z","timestamp":1725866484011},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319467702"},{"type":"electronic","value":"9783319467719"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46771-9_20","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T07:52:58Z","timestamp":1474962778000},"page":"149-156","source":"Crossref","is-referenced-by-count":0,"title":["Network Visual Analysis Based on Community Detection"],"prefix":"10.1007","author":[{"given":"Yao","family":"Zhonghua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Lingda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"66111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 66111 (2004)","journal-title":"Phys. Rev. E"},{"key":"20_CR3","unstructured":"Eades, P.: A heuristic for graph drawing (1984)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"crossref","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. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pr. Exp. 21, 1129\u20131164 (1991)","journal-title":"Softw. Pr. Exp."},{"key":"20_CR6","doi-asserted-by":"crossref","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 Trans. Graph. 15, 301\u2013331 (1996)","journal-title":"ACM Trans. Graph."},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"key":"20_CR8","doi-asserted-by":"crossref","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 324, 446\u2013449 (1986)","journal-title":"Nature"},{"key":"20_CR9","unstructured":"The Barnes-Hut Algorithm: http:\/\/arborjs.org\/docs\/barnes-hut"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1984, pp. 211\u2013221. Springer, Heidelberg (2001)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1984, pp. 183\u2013196. Springer, Heidelberg (2001)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph Drawing","author":"A Quigley","year":"2001","unstructured":"Quigley, A., Eades, P.: FADE: graph drawing, clustering, and visual abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 197\u2013210. Springer, Heidelberg (2001)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","first-page":"413","volume-title":"Graph Drawing","author":"D Tunkelang","year":"1999","unstructured":"Tunkelang, D.: JIGGLE: java interactive graph layout environment. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 413\u2013422. Springer, Heidelberg (1999)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1984, pp. 171\u2013182. Springer, Heidelberg (2001)"},{"volume-title":"Readings in Information Visualization: Using Vision to Think","year":"1999","key":"20_CR15","unstructured":"Card, S.K., Mackinlay, J.D., Shneiderman, B. (eds.): Readings in Information Visualization: Using Vision to Think. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Sarkar, M., Brown, M.H.: Graphical fisheye views of graphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 83\u201391","DOI":"10.1145\/142750.142763"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/TVCG.2004.1260759","volume":"10","author":"M Tory","year":"2004","unstructured":"Tory, M., Moller, T.: Human factors in visualization research. IEEE Trans. Vis. Comput. Graph. 10, 72\u201384 (2004)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Cooperative Design, Visualization, and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46771-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:46:20Z","timestamp":1498347980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46771-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319467702","9783319467719"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46771-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}