Readable Representations for Large-Scale Bipartite Graphs

Authors:
Shuji Sato;Kazuo Misue;Jiro Tanaka
Affiliations:
Department of Computer Science, University of Tsukuba, Tsukuba, Japan 305-8573;Department of Computer Science, University of Tsukuba, Tsukuba, Japan 305-8573;Department of Computer Science, University of Tsukuba, Tsukuba, Japan 305-8573
Venue:
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Year:
2008

Citing 4
Cited 0

Edge concentration: a method for clustering directed graphs

SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
Visualization of mobile object environments

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Drawing bipartite graphs as anchored maps

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Visualizing large and clustered networks

GD'06 Proceedings of the 14th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is available to us has increased dramatically in recent years, and it is therefore necessary to develop a drawing technique that corresponds to large-scale graphs. In this paper, we describe drawing methods to make large-scale bipartite graphs easy to read. We propose two techniques: "node contraction drawing," which involves collecting similar nodes and drawing them as one node, and "isosimilarity contour drawing," which puts clusters into an outlined area. We developed interactive user interfaces for the drawing methods and conducted an evaluation experiment to demonstrate the effectiveness of the proposed techniques.