J. Abello, F. Van-ham, and N. Krishnan, ASK-GraphView: A Large Scale Graph Visualization System, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.669-676, 2006.
DOI : 10.1109/TVCG.2006.120

U. Alon, Network motifs: theory and experimental approaches, Nature Reviews Genetics, vol.301, issue.6, pp.450-461, 2007.
DOI : 10.1038/nrg2102

D. Archambault, T. Munzner, and D. Auber, GrouseFlocks: Steerable Exploration of Graph Hierarchy Space, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.4, pp.900-913, 2008.
DOI : 10.1109/TVCG.2008.34

URL : https://hal.archives-ouvertes.fr/inria-00338627

D. Archambault, H. C. Purchase, and B. Pinaud, The Readability of Path-Preserving Clusterings of Graphs, Computer Graphics Forum, vol.15, issue.6, pp.1173-1182, 2010.
DOI : 10.1111/j.1467-8659.2009.01683.x

URL : https://hal.archives-ouvertes.fr/inria-00471432

E. Arias-castro and G. R. Grimmett, Cluster detection in networks using percolation, Bernoulli, vol.19, issue.2, pp.676-719, 2013.
DOI : 10.3150/11-BEJ412

URL : http://arxiv.org/abs/1104.0338

A. Barabasiánd and R. Albert, Emergence of scaling in random networks, science, vol.286, issue.5439, pp.509-512, 1999.

M. S. Carpendale and X. Rong, Examining edge congestion, CHI '01 extended abstracts on Human factors in computing systems , CHI '01, pp.115-116, 2001.
DOI : 10.1145/634067.634137

M. Dickerson, D. Eppstein, M. T. Goodrich, and J. Y. Meng, Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way, Journal of Graph Algorithms and Applications, vol.9, issue.1, pp.31-52, 2005.
DOI : 10.7155/jgaa.00099

K. Dinkla, M. A. Westenberg, and J. J. Van-wijk, Compressed Adjacency Matrices: Untangling Gene Regulatory Networks, IEEE Transactions on Visualization and Computer Graphics, vol.18, issue.12, pp.2457-2466, 2012.
DOI : 10.1109/TVCG.2012.208

URL : http://repository.tue.nl/740346

C. Dunne and B. Shneiderman, Motif simplification, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI '13, pp.3247-3256, 2013.
DOI : 10.1145/2470654.2466444

T. Dwyer, C. Mears, K. Morgan, T. Niven, K. Marriott et al., Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs, 2014 IEEE Pacific Visualization Symposium, pp.105-112, 2014.
DOI : 10.1109/PacificVis.2014.46

T. Dwyer, N. H. Riche, K. Marriott, and C. Mears, Edge Compression Techniques for Visualization of Dense Directed Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.19, issue.12, pp.2596-2605, 2013.
DOI : 10.1109/TVCG.2013.151

T. Eltoft and R. J. Defigueiredo, A new neural network for cluster-detection-and-labeling, IEEE Transactions on Neural Networks, vol.9, issue.5, pp.1021-1035, 1998.
DOI : 10.1109/72.712183

D. Eppstein, M. T. Goodrich, and J. Y. Meng, Delta-Confluent Drawings, Graph Drawing, pp.165-176, 2005.
DOI : 10.1007/11618058_16

URL : http://arxiv.org/abs/cs/0510024

D. Eppstein, D. Holten, M. Loffler, ¨. M. Nollenburg, ¨. B. Speckmann et al., Strict Confluent Drawing, Graph Drawing, pp.352-363, 2013.
DOI : 10.1007/978-3-319-03841-4_31

URL : http://arxiv.org/abs/1308.6824

D. Eppstein and J. A. Simons, Confluent hasse diagrams, Graph Drawing, pp.2-13, 2011.
DOI : 10.7155/jgaa.00312

URL : http://arxiv.org/abs/1108.5361

O. Ersoy, C. Hurter, F. Paulovich, G. Cantareiro, and A. Telea, Skeleton-Based Edge Bundling for Graph Visualization, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.12, pp.2364-2373, 2011.
DOI : 10.1109/TVCG.2011.233

URL : https://hal.archives-ouvertes.fr/hal-01021607

D. Field, A. Hayes, and R. Hess, Contour integration by the human visual system: Evidence for a local ???association field???, Vision Research, vol.33, issue.2, 1993.
DOI : 10.1016/0042-6989(93)90156-Q

E. R. Gansner, Y. Hu, S. North, and C. Scheidegger, Multilevel agglom-erative edge bundling for visualizing large graphs, 2011 IEEE Pacific Visualization Symposium, pp.187-194, 2011.
DOI : 10.1109/pacificvis.2011.5742389

N. Henry and J. Fekete, MatrixExplorer: a Dual-Representation System to Explore Social Networks, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.677-684, 2006.
DOI : 10.1109/TVCG.2006.160

URL : https://hal.archives-ouvertes.fr/hal-00876592

M. Hirsch, H. Meijer, and D. Rappaport, Biclique Edge Cover Graphs and Confluent Drawings, Graph Drawing, pp.405-416, 2006.
DOI : 10.1007/978-3-540-70904-6_39

D. Holten, Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.741-748, 2006.
DOI : 10.1109/TVCG.2006.147

D. Holten, P. Isenberg, J. J. Van-wijk, and J. D. Fekete, An extended evaluation of the readability of tapered, animated, and textured directededge representations in node-link graphs, Visualization Symposium (PacificVis), 2011 IEEE Pacific, pp.195-202, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00548180

D. Holten and J. J. Van-wijk, Force-Directed Edge Bundling for Graph Visualization, Proceedings of the 11th Eurographics / IEEE -VGTC Conference on Visualization, EuroVis'09, pp.983-998, 2009.
DOI : 10.1111/j.1467-8659.2009.01450.x

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.7989

P. Hui, M. Schaefer, and D. Stefankovic?, Train tracks and confluent drawings, Graph Drawing, pp.318-328, 2004.
DOI : 10.1007/s00453-006-0165-x

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.6810

C. Hurter, O. Ersoy, S. I. Fabrikant, T. R. Klein, and A. C. Telea, Bundled Visualization of DynamicGraph and Trail Data, IEEE Transactions on Visualization and Computer Graphics, vol.20, issue.8, pp.1141-1157, 2014.
DOI : 10.1109/TVCG.2013.246

C. Hurter, O. Ersoy, and A. Telea, Graph Bundling by Kernel Density Estimation, Computer Graphics Forum, vol.9, issue.2, pp.865-874, 2012.
DOI : 10.1111/j.1467-8659.2012.03079.x

URL : https://hal.archives-ouvertes.fr/hal-01022472

S. Lehmann, M. Schwartz, and L. K. Hansen, Biclique communities, Physical Review E, vol.78, issue.1, p.16108, 2008.
DOI : 10.1103/PhysRevE.78.016108

URL : http://orbit.dtu.dk/ws/files/4829764/Sune.pdf

S. Luo, C. Liu, B. Chen, and K. Ma, Ambiguity-free edgebundling for interactive graph visualization, IEEE Transactions on Visual-ization and Computer Graphics, vol.18, issue.5, pp.810-821, 2012.

M. E. Newman and M. Girvan, Finding and evaluating community struc-ture in networks, p.26113, 2004.

Q. Nguyen, P. Eades, and S. Hong, On the faithfulness of graph visualizations, Visualization Symposium (PacificVis), 2013 IEEE Pacific, pp.209-216, 2013.

V. Peysakhovich, C. Hurter, and A. Telea, Attribute-driven edge bundling for general graphs with applications in trail analysis. Visualization Sympo-sium (PacificVis), IEEE Pacific, pp.39-46, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01158976

D. Phan, L. Xiao, R. Yeh, P. Hanrahan, and T. Winograd, Flow map layout, Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization, INFOVIS '05, p.29, 2005.

S. Pupyrev, L. Nachmanson, S. Bereg, and A. E. Holroyd, Edge routing with ordered bundles, Proc. 19th Internat. Sympos. on Graph Drawing, pp.136-147, 2011.
DOI : 10.1007/978-3-642-25878-7_14

URL : http://arxiv.org/abs/1209.4227

G. Quercini and M. Ancona, Confluent Drawing Algorithms Using Rectangular Dualization, Graph Drawing, pp.341-352, 2010.
DOI : 10.1007/978-3-642-18469-7_31

L. Royer, M. Reimann, B. Andreopoulos, and M. Schroeder, Unraveling Protein Networks with Power Graph Analysis, PLoS Computational Biology, vol.34, issue.7, pp.1-17, 2008.
DOI : 10.1371/journal.pcbi.1000108.t004

URL : http://doi.org/10.1371/journal.pcbi.1000108

D. Selassie, B. Heller, and J. Heer, Divided Edge Bundling for Directional Network Data, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.12, pp.2354-2363, 2011.
DOI : 10.1109/TVCG.2011.190

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.688.1933

M. Van-der-zwan, V. Codreanu, and A. Telea, CUBu: Universal Real-Time Bundling for Large Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.22, issue.12, pp.1-1, 2016.
DOI : 10.1109/TVCG.2016.2515611

C. Ware, H. Purchase, L. Colpoys, and M. Mcgill, Cognitive measurements of graph aesthetics, Information Visualization, vol.1, issue.2, pp.103-110, 2002.
DOI : 10.1057/palgrave.ivs.9500013

S. Wasserman and K. Faust, Social network analysis: Methods and applications, 1994.
DOI : 10.1017/CBO9780511815478

N. Wong, S. Carpendale, and S. Greenberg, Edgelens: an interactive method for managing edge congestion in graphs, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), pp.51-58, 2003.
DOI : 10.1109/INFVIS.2003.1249008

H. Zhou, P. Xu, X. Yuan, and H. Qu, Edge bundling in information visualization, Tsinghua Science and Technology, vol.18, issue.2, pp.145-156, 2013.
DOI : 10.1109/TST.2013.6509098

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.2226