Challenger, a New Way to Visualize Data

Zelina, Remus and Bota, Sebastian and Houtman, Siebren and Van Assen, Jaap Jan and Hattink, Bas (2012) Challenger, a New Way to Visualize Data. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 447-448 (Official URL:

Full text not available from this repository.


Challenger is a software product that provides fast and online data visualization. This is done by visualizing data (graphs) as a network. Both force based and modularization algorithms are used and experimented with. Challenger facilitates fast and easy understanding of complex data. This is not only a matter of showing one ‘perfect’ visualization, but rather of letting users browse, analyze and ‘play’ visually with (subsets of) data interactively.

Item Type:Conference Paper
Additional Information:10.1007/978-3-642-25878-7_46
Classifications:S Software and Systems > S.999 Others
ID Code:1281

Repository Staff Only: item control page


Fruchterman, T., Reingold, E.: Graph Drawing by Force-directed Placement. Software- Practice and Experience 21(11), 1129–1164 (1991)

Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31(1), 7–15 (1989)

Noack, A.: Energy Models for Graph Clustering. Journal of Graph Algorithms and Applications 11(2), 453–480 (2007)

Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70, 066111 (2004)

Wakita, K., Tsurumi, T.: Finding community structure in mega-scale social networks. In: Proceedings of the 16th International Conference on World Wide Web, Banff, Alberta, Canada, pp. 1275–1276. ACM, New York (2007)

Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of community hierarchies in large networks. J. Stat. Mech. (10), P10008 (2008)