{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:25:32Z","timestamp":1761978332345,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_27","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"304-315","source":"Crossref","is-referenced-by-count":2,"title":["Exploring Complex Drawings via Edge Stratification"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Auber, D., Chiricota, Y., Jourdan, F., Melan\u00e7on, G.: Multiscale visualization of small world networks. In: InfoVis 2003, pp. 75\u201381. IEEE (2003)","DOI":"10.1109\/INFVIS.2003.1249011"},{"issue":"5439","key":"27_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.-L. Barabasi","year":"1999","unstructured":"Barabasi, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"11","key":"27_CR3","first-page":"1587","volume":"17","author":"V. Batagelj","year":"2011","unstructured":"Batagelj, V., Brandenburg, F., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual analysis of large graphs using (X,Y)-clustering and hybrid visualizations. IEEE TVCG\u00a017(11), 1587\u20131598 (2011)","journal-title":"IEEE TVCG"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-11805-0_12","volume-title":"Graph Drawing","author":"U. Brandes","year":"2010","unstructured":"Brandes, U., Pich, C.: More flexible radial layout. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 107\u2013118. Springer, Heidelberg (2010)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Comm. ACM\u00a022, 251\u2013256 (1979)","journal-title":"Comm. ACM"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-36763-2_7","volume-title":"Graph Drawing","author":"T. Bruckdorfer","year":"2013","unstructured":"Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., N\u00f6llenburg, M., Wolff, A.: Progress on partial edge drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 67\u201378. Springer, Heidelberg (2013)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","first-page":"179","volume-title":"GD 2011","author":"E. Brunel","year":"2011","unstructured":"Brunel, E., Gemsa, A., Krug, M., Rutter, I., Wagner, D.: Generalizing geometric graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 179\u2013190. Springer, Heidelberg (2011)"},{"key":"27_CR8","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/0196-6774(90)90032-A","volume":"11","author":"M. Chrobak","year":"1990","unstructured":"Chrobak, M., Nishizeki, T.: Improved edge-coloring algorithms for planar graphs. J. Algo.\u00a011(1), 102\u2013116 (1990)","journal-title":"J. Algo."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-34611-8_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Giacomo Di","year":"2012","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: h-quasi planar drawings of bounded treewidth graphs in linear area. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 91\u2013102. Springer, Heidelberg (2012)"},{"issue":"8","key":"27_CR11","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1016\/j.comgeo.2013.03.001","volume":"46","author":"E. Di Giacomo","year":"2013","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F.: Area requirement of graph drawings with few crossings per edge. Comp. Geom.\u00a046(8), 909\u2013916 (2013)","journal-title":"Comp. Geom."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G.: The crossing angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer (2012)","DOI":"10.1007\/978-1-4614-0110-0_10"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Didimo, W., Montecchiani, F.: Fast layout computation of hierarchically clustered networks: Algorithmic advances and experimental analysis. In: IV 2012, pp. 18\u201323 (2012)","DOI":"10.1109\/IV.2012.14"},{"issue":"3","key":"27_CR14","first-page":"5","volume":"4","author":"M.B. Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. Jour. Graph. Alg. and Appl.\u00a04(3), 5\u201317 (2000)","journal-title":"Jour. Graph. Alg. and Appl."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: SoCG 2004, pp. 340\u2013346. ACM (2004)","DOI":"10.1145\/997817.997868"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"Graph Drawing","author":"A. Frick","year":"1995","unstructured":"Frick, A., Ludwig, A., Mehldau, H.: A fast adaptive layout algorithm for undirected graphs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 388\u2013403. Springer, Heidelberg (1995)"},{"issue":"11","key":"27_CR17","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. Softw. Pract. Exper.\u00a021(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"12","key":"27_CR18","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS\u00a099(12), 7821\u20137826 (2002)","journal-title":"PNAS"},{"key":"27_CR19","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":"4","key":"27_CR20","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput.\u00a010(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"27_CR21","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.\u00a031(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"27_CR22","unstructured":"Knuth, D.E.: The Stanford Graphbase: A Platform for Combinatorial Computing. Addison-Wesley Professional (1993)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E\u00a078(4) (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"27_CR24","unstructured":"Michael Fire, Y.E., Puzis, R.: Organization mining using online social networks (2012), http:\/\/proj.ise.bgu.ac.il\/sns"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2002","unstructured":"Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.): GD 2001. LNCS, vol.\u00a02265. Springer, Heidelberg (2002)"},{"issue":"2","key":"27_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"H.C. Purchase","year":"2000","unstructured":"Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput.\u00a013(2), 147\u2013162 (2000)","journal-title":"Interact. Comput."},{"issue":"3","key":"27_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"H.C. Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.-A.: Empirical evaluation of aesthetics-based graph layout. Empir. Softw. Eng.\u00a07(3), 233\u2013255 (2002)","journal-title":"Empir. Softw. Eng."},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-36763-2_40","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"2013","unstructured":"Purchase, H.C., Hamer, J., N\u00f6llenburg, M., Kobourov, S.G.: On the usability of lombardi graph drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 451\u2013462. Springer, Heidelberg (2013)"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-36763-2_2","volume-title":"Graph Drawing","author":"B. Shneiderman","year":"2013","unstructured":"Shneiderman, B., Dunne, C.: Interactive network exploration to derive insights: Filtering, clustering, grouping, and simplification. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 2\u201318. Springer, Heidelberg (2013)"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"van Ham, F., van Wijk, J.J.: Interactive visualization of small world graphs. In: InfoVis 2004, pp. 199\u2013206. IEEE (2004)","DOI":"10.1109\/INFVIS.2004.43"},{"key":"27_CR31","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz No.\u00a03, 25\u201330 (1964)","journal-title":"Diskret. Analiz No."},{"issue":"2","key":"27_CR32","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TST.2013.6509098","volume":"18","author":"H. Zhou","year":"2013","unstructured":"Zhou, H., Xu, P., Yuan, X., Qu, H.: Edge bundling in information visualization. Tsinghua Science and Technology\u00a018(2), 145\u2013156 (2013)","journal-title":"Tsinghua Science and Technology"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:56:32Z","timestamp":1746060992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}