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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Misue, K.: Drawing bipartite graphs as anchored maps. In: Proceedings of Asia-Pacific Symposium on Information Visualization (APVIS 2006). CRIPT, vol. 60, pp. 169–177 (2006)
Misue, K.: Overview of Network Intormation by Using Anchored Maps. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 1269–1276. Springer, Heidelberg (2007)
Newman, M.E.J.: Coauthorship networks and patterns of scientific collaboration. Proceedings of the National Academy of Sciences of the USA 101(suppl. 1), 5200–5205 (2004)
Eades, P.: A heuristic for graph drawing. Congressus Numeranitium 42, 149–160 (1984)
Lehmann, K.A., Kottler, S.: Visualizing Large and Clustered Networks. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 240–251. Springer, Heidelberg (2007)
Frishman, Y., Tal, A.: Visualization of Mobile Object Environments. In: Proceedings of the 2005 ACM symposium on Software visualization, pp. 145–154 (2005)
Newbery, F.J.: Edge concentration: a method for clustering directed graphs. In: Proceedings of the 2nd International Workshop on Software configuration management, pp. 76–85 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sato, S., Misue, K., Tanaka, J. (2008). Readable Representations for Large-Scale Bipartite Graphs. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science(), vol 5178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85565-1_103
Download citation
DOI: https://doi.org/10.1007/978-3-540-85565-1_103
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85564-4
Online ISBN: 978-3-540-85565-1
eBook Packages: Computer ScienceComputer Science (R0)