Visualization and analysis of large graphs

In Knowledge engineering, synthesized information has often an evolving and relational form. Information representation using graphs may ease data interpretation for non-expert users. However this graph may be complex and simplifications are useful in order to ease analysis. In this article, we present VisuGraph, a powerful tool for graph drawing. This tool gives the possibility to reduce large graph by two techniques: the Markov CLustering algorithm (MCL) application and the global graph division in time-sliced visualizations in order to specify and to simplify temporal analysis.

[1]  Mark Newman,et al.  The structure and function of networks , 2002 .

[2]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[3]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[4]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[5]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[6]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[7]  S. vanDongen.  Graph Clustering by Flow Simulation , 2000 .

[8]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[9]  S N Dorogovtsev,et al.  Effect of the accelerating growth of communications networks on their structure. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  A. Barab,et al.  Evolution of the social network of scienti $ c collaborations , 2002 .

[11]  Anton J. Enright,et al.  An efficient algorithm for large-scale detection of protein families. , 2002, Nucleic acids research.

[12]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[13]  Andrew B. Kahng,et al.  Recent developments in netlist partitioning: a survey , 1995 .

[14]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[15]  Pascale Kuntz,et al.  Extraction de structures macroscopiques dans des grands graphes par une approche spectrale , 2002, EGC.

[16]  F. Hénaux,et al.  Numerical Comparisons of two Spectral Decompositions for Vertex Clustering , 2000 .

[17]  Jacques van Helden,et al.  Evaluation of clustering algorithms for protein-protein interaction networks , 2006, BMC Bioinformatics.