Drawing clustered bipartite graphs in multi-circular style

Takao Ito, Kazuo Misue, Jiro Tanaka

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
Externally publishedYes
Event2010 14th International Conference Information Visualisation, IV 2010 - London, United Kingdom
Duration: 2010 Jul 262010 Jul 29

Other

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

Fingerprint

Drawing (graphics)
Websites
Visualization

Keywords

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

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Software
  • Signal Processing

Cite this

Ito, T., Misue, K., & Tanaka, J. (2010). Drawing clustered bipartite graphs in multi-circular style. In Proceedings - 2010 14th International Conference Information Visualisation, IV 2010 (pp. 23-28). [5571375] https://doi.org/10.1109/IV.2010.13

Drawing clustered bipartite graphs in multi-circular style. / Ito, Takao; Misue, Kazuo; Tanaka, Jiro.

Proceedings - 2010 14th International Conference Information Visualisation, IV 2010. 2010. p. 23-28 5571375.

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

Ito, T, Misue, K & Tanaka, J 2010, Drawing clustered bipartite graphs in multi-circular style. in Proceedings - 2010 14th International Conference Information Visualisation, IV 2010., 5571375, pp. 23-28, 2010 14th International Conference Information Visualisation, IV 2010, London, United Kingdom, 10/7/26. https://doi.org/10.1109/IV.2010.13
Ito T, Misue K, Tanaka J. Drawing clustered bipartite graphs in multi-circular style. In Proceedings - 2010 14th International Conference Information Visualisation, IV 2010. 2010. p. 23-28. 5571375 https://doi.org/10.1109/IV.2010.13
Ito, Takao ; Misue, Kazuo ; Tanaka, Jiro. / Drawing clustered bipartite graphs in multi-circular style. Proceedings - 2010 14th International Conference Information Visualisation, IV 2010. 2010. pp. 23-28
@inproceedings{3771141d0b8e4d16b6a3b96a488fb339,
title = "Drawing clustered bipartite graphs in multi-circular style",
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.",
keywords = "Anchored maps, Bipartite graph, Circular layout, Graph drawing, Hierarchical structure",
author = "Takao Ito and Kazuo Misue and Jiro Tanaka",
year = "2010",
doi = "10.1109/IV.2010.13",
language = "English",
isbn = "9780769541655",
pages = "23--28",
booktitle = "Proceedings - 2010 14th International Conference Information Visualisation, IV 2010",

}

TY - GEN

T1 - Drawing clustered bipartite graphs in multi-circular style

AU - Ito, Takao

AU - Misue, Kazuo

AU - Tanaka, Jiro

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Anchored maps

KW - Bipartite graph

KW - Circular layout

KW - Graph drawing

KW - Hierarchical structure

UR - http://www.scopus.com/inward/record.url?scp=78449306289&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78449306289&partnerID=8YFLogxK

U2 - 10.1109/IV.2010.13

DO - 10.1109/IV.2010.13

M3 - Conference contribution

SN - 9780769541655

SP - 23

EP - 28

BT - Proceedings - 2010 14th International Conference Information Visualisation, IV 2010

ER -