{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:46Z","timestamp":1742912446471,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_1","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Distributed Multilevel Force-Directed Algorithm"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Arleo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"1_CR1","unstructured":"http:\/\/www.geeksykings.eu\/multigila\/"},{"key":"1_CR2","unstructured":"http:\/\/ls11-www.cs.tu-dortmund.de\/staff\/klein\/gdmult10"},{"key":"1_CR3","unstructured":"http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"1_CR4","unstructured":"http:\/\/www.networkrepository.com\/"},{"key":"1_CR5","unstructured":"Arleo, A., Didimo, W., Liotta, G., Montecchiani, F.: A distributed force-directed algorithm on Giraph: design and experiments. ArXiv e-prints (2016). \n                      http:\/\/arxiv.org\/abs\/1606.02162"},{"key":"1_CR6","unstructured":"Arleo, A., Didimo, W., Liotta, G., Montecchiani, F.: A distributed multilevel force-directed algorithm. ArXiv e-prints (2016). \n                      http:\/\/arxiv.org\/abs\/1608.08522"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-27261-0_4","volume-title":"Graph Drawing and Network Visualization","author":"A Arleo","year":"2015","unstructured":"Arleo, A., Didimo, W., Liotta, G., Montecchiani, F.: A million edge drawing for a fistful of dollars. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 44\u201351. Springer, Heidelberg (2015). doi:\n                      10.1007\/978-3-319-27261-0_4"},{"key":"1_CR8","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). doi:\n                      10.1007\/978-3-642-18469-7_8"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chae, S., Majumder, A., Gopi, M.: Hd-graphviz: Highly distributed graph visualization on tiled displays. In: ICVGIP 2012, pp. 43: 1\u201343: 8. ACM (2012)","DOI":"10.1145\/2425333.2425376"},{"key":"1_CR10","first-page":"543","volume-title":"Handbook on Graph Drawing and Visualization","author":"M Chimani","year":"2013","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 543\u2013569. CRC, Boca Raton (2013). \n                      http:\/\/www.ogdf.net\/"},{"key":"1_CR11","unstructured":"Ching, A.: Giraph: large-scale graph processing infrastructure on hadoop. In: Hadoop Summit (2011)"},{"issue":"12","key":"1_CR12","first-page":"1804","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., Muthukrishnan, S.: One trillion edges: graph processing at facebook-scale. PVLDB 8(12), 1804\u20131815 (2015)","journal-title":"PVLDB"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ins.2013.09.048","volume":"260","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Montecchiani, F.: Fast layout computation of clustered networks: algorithmic advances and experimental analysis. Inf. Sci. 260, 185\u2013199 (2014). \n                      http:\/\/dx.doi.org\/10.1016\/j.ins.2013.09.048","journal-title":"Inf. Sci."},{"issue":"11","key":"1_CR14","doi-asserted-by":"publisher","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. Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P Gajer","year":"2004","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. 29(1), 3\u201318 (2004)","journal-title":"Comput. Geom."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-00219-9_10","volume-title":"Graph Drawing","author":"A Godiyal","year":"2009","unstructured":"Godiyal, A., Hoberock, J., Garland, M., Hart, J.C.: Rapid multipole graph drawing on the GPU. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 90\u2013101. Springer, Heidelberg (2009). doi:\n                      10.1007\/978-3-642-00219-9_10"},{"key":"1_CR17","unstructured":"Hachul, S.: A potential field based multilevel algorithm for drawing large graphs. Ph.D. thesis, University of Cologne (2005). \n                      http:\/\/kups.ub.uni-koeln.de\/volltexte\/2005\/1409\/index.html"},{"key":"1_CR18","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). doi:\n                      10.1007\/978-3-540-31843-9_29"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00150","volume":"11","author":"S Hachul","year":"2007","unstructured":"Hachul, S., J\u00fcnger, M.: Large-graph layout algorithms at work: an experimental study. J. Graph Algorithms Appl. 11(2), 345\u2013369 (2007)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"1_CR20","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":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D Harel","year":"2002","unstructured":"Harel, D., Koren, 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":"1_CR22","doi-asserted-by":"crossref","unstructured":"Hinge, A., Auber, D.: Distributed graph layout with Spark. In: IV 2015, pp. 271\u2013276. IEEE (2015)","DOI":"10.1109\/iV.2015.56"},{"issue":"1","key":"1_CR23","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":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/TVCG.2008.85","volume":"15","author":"S Ingram","year":"2009","unstructured":"Ingram, S., Munzner, T., Olano, M.: Glimmer: Multilevel MDS on the GPU. IEEE Trans. Vis. Comput. Graph. 15(2), 249\u2013261 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"1_CR25","volume-title":"Handbook of Graph Drawing and Visualization","author":"SG Kobourov","year":"2013","unstructured":"Kobourov, S.G.: Force-directed drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press, Boca Raton (2013)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: SIGMOD 2010, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"1_CR27","unstructured":"Mueller, C., Gregor, D., Lumsdaine, A.: Distributed force-directed graph layout and visualization. In: EGPGV 2006, pp. 83\u201390. Eurographics (2006)"},{"issue":"2","key":"1_CR28","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/2897350.2897355","volume":"17","author":"RA Rossi","year":"2016","unstructured":"Rossi, R.A., Ahmed, N.K.: An interactive data repository with visual analytics. SIGKDD Explor. 17(2), 37\u201341 (2016). \n                      http:\/\/networkrepository.com","journal-title":"SIGKDD Explor."},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-19656-0_35","volume-title":"Social Computing, Behavioral-Cultural Modeling and Prediction","author":"P Sharma","year":"2011","unstructured":"Sharma, P., Khurana, U., Shneiderman, B., Scharrenbroich, M., Locke, J.: Speeding up network layout and centrality measures for social computing goals. In: Salerno, J., Yang, S.J., Nau, D., Chai, S.-K. (eds.) SBP 2011. LNCS, vol. 6589, pp. 244\u2013251. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-19656-0_35"},{"key":"1_CR30","unstructured":"Tikhonova, A., Ma, K.: A scalable parallel force-directed graph layout algorithm. In: EGPGV 2008, pp. 25\u201332. Eurographics (2008)"},{"issue":"8","key":"1_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Vaquero, L.M., Cuadrado, F., Logothetis, D., Martella, C.: Adaptive partitioning for large-scale dynamic graphs. In: ICDCS 2014, pp. 144\u2013153. IEEE (2014)","DOI":"10.1109\/ICDCS.2014.23"},{"issue":"3","key":"1_CR33","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C Walshaw","year":"2003","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl. 7(3), 253\u2013285 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Yunis, E., Yokota, R., Ahmadia, A.: Scalable force directed graph layout algorithms using fast multipole methods. In: ISPDC 2012, pp. 180\u2013187. IEEE (2012)","DOI":"10.1109\/ISPDC.2012.32"},{"issue":"12","key":"1_CR35","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/TVCG.2012.238","volume":"18","author":"M Zinsmaier","year":"2012","unstructured":"Zinsmaier, M., Brandes, U., Deussen, O., Strobelt, H.: Interactive level-of-detail rendering of large graphs. IEEE Trans. Vis. Comput. Graph. 18(12), 2486\u20132495 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:39:08Z","timestamp":1600475948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}