{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:30:42Z","timestamp":1769585442614,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_11","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"139-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-level Graph Drawing Using Infomap Clustering"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]},{"given":"Marnijati","family":"Torkel","sequence":"additional","affiliation":[]},{"given":"Ziyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"David","family":"Chae","sequence":"additional","affiliation":[]},{"given":"Sungpack","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Langerenken","sequence":"additional","affiliation":[]},{"given":"Hassan","family":"Chafi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"11_CR1","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 324, 446 (1986)","journal-title":"Nature"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-18469-7_8","volume-title":"Graph Drawing","author":"G Bartel","year":"2011","unstructured":"Bartel, G., Gutwenger, C., Klein, K., Mutzel, P.: An experimental evaluation of multilevel layout methods. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 80\u201391. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_8"},{"key":"11_CR3","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Handbook on Graph Drawing and Visualization, pp. 543\u2013569 (2013)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-27261-0_41","volume-title":"Graph Drawing and Network Visualization","author":"P Eades","year":"2015","unstructured":"Eades, P., Hong, S.-H., Klein, K., Nguyen, A.: Shape-based quality metrics for large graph visualization. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 502\u2013514. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_41"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","volume":"13","author":"Y Frishman","year":"2007","unstructured":"Frishman, Y., Tal, A.: Multi-level graph layout on the GPU. IEEE Trans. Vis. Comput. Graph. 13(6), 1310\u20131319 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"11","key":"11_CR6","first-page":"1129","volume":"21","author":"TM Fruchterman","year":"1991","unstructured":"Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Softw.: Pract. Exper. 21(11), 1129\u20131164 (1991)","journal-title":"Softw.: Pract. Exper."},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00052","volume":"6","author":"P Gajer","year":"2002","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: graph drawing with intelligent placement. J. Graph Algorithms Appl. 6(3), 203\u2013224 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., North, S.C.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph. 19(6), 927\u2013940 (2013)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"11_CR9","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. 3383, pp. 285\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_29"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00389-9","volume":"113","author":"R Hadany","year":"2001","unstructured":"Hadany, R., Harel, D.: A multi-scale algorithm for drawing graphs nicely. Discrete Appl. Math. 113(1), 3\u201321 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR11","first-page":"37","volume":"10","author":"Y Hu","year":"2005","unstructured":"Hu, Y.: Efficient, high-quality force-directed graph drawing. Mathematica J. 10(1), 37\u201371 (2005)","journal-title":"Mathematica J."},{"issue":"1","key":"11_CR12","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. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-662-45803-7_20","volume-title":"Graph Drawing","author":"SG Kobourov","year":"2014","unstructured":"Kobourov, S.G., Pupyrev, S., Saket, B.: Are crossings important for drawing large graphs? In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 234\u2013245. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_20"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D Koren","year":"2002","unstructured":"Koren, D., Harel, Y.: A fast multi-scale method for drawing large graphs. J. Graph Algorithms Appl. 6(3), 179\u2013202 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis. Phys. Rev. E 80, 056117 (2009)","journal-title":"Phys. Rev. E"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-27261-0_3","volume-title":"Graph Drawing and Network Visualization","author":"H Meyerhenke","year":"2015","unstructured":"Meyerhenke, H., N\u00f6llenburg, M., Schulz, C.: Drawing large graphs by multilevel maxent-stress optimization. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 30\u201343. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_3"},{"key":"11_CR17","unstructured":"Nguyen, A., Hong, S.: k-core based multi-level graph visualization for scale-free networks. In: 2017 IEEE Pacific Visualization Symposium, PacificVis 2017, Seoul, South Korea, 18\u201321 April 2017, pp. 21\u201325 (2017)"},{"key":"11_CR18","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 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). https:\/\/doi.org\/10.1007\/3-540-44541-2_19"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Nat. Acad. Sci. 105(4), 1118\u20131123 (2008)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C Walshaw","year":"2003","unstructured":"Walshaw, C., et al.: A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl. 7(3), 253\u2013285 (2003)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:25Z","timestamp":1701133405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}