Drawing clustered bipartite graphs in multi-circular style

Takao Ito*, Kazuo Misue, Jiro Tanaka

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hierarchically, for example, web pages are divided into directories by their contents. The hierarchical structures are useful for analyzing information. Graphs with both a bipartite structure and a hierarchical structure are called "clustered bipartite graphs." A new clustered bipartite graphs visualization technique was developed for representing both bipartite and hierarchical structures simultaneously. In this technique, nodes in one set of the bipartite graph, which are leaves of a tree, are arranged in hierarchical multi-circular style. Then, nodes in the other set of the bipartite graph are arranged by the force-directed method. The technique enables step-by-step exploration for large-scale bipartite graphs.

Original languageEnglish
Title of host publicationProceedings - 2010 14th International Conference Information Visualisation, IV 2010
Pages23-28
Number of pages6
DOIs
Publication statusPublished - 2010 Nov 24
Externally publishedYes
Event2010 14th International Conference Information Visualisation, IV 2010 - London, United Kingdom
Duration: 2010 Jul 262010 Jul 29

Publication series

NameProceedings of the International Conference on Information Visualisation
ISSN (Print)1093-9547

Other

Other2010 14th International Conference Information Visualisation, IV 2010
Country/TerritoryUnited Kingdom
CityLondon
Period10/7/2610/7/29

Keywords

  • Anchored maps
  • Bipartite graph
  • Circular layout
  • Graph drawing
  • Hierarchical structure

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'Drawing clustered bipartite graphs in multi-circular style'. Together they form a unique fingerprint.

Cite this