By Topic

Drawing Semi-bipartite Graphs in Anchor+Matrix Style

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Misue, K. ; Dept. of Comput. Sci., Univ. of Tsukuba, Tsukuba, Japan ; Qi Zhou

A bipartite graph consists of a set of nodes that can be divided into two partitions such that no edge has both endpoints in the same partition. A semi-bipartite graph is a bipartite graph with edges in one partition. Anchored map is a graph drawing technique for bipartite graphs and provides aesthetically pleasing layouts of graphs with high readability by restricting the positions of nodes in a partition. For this research, the objects of the anchored map technique were extended to semi-bipartite graphs. A hybrid layout style of anchored maps and matrix representations are proposed, and an automatic drawing technique is shown. The proposed technique arranges the nodes in one partition on a circumference like the anchored map of bipartite graphs. It also divides nodes in the other partition with edges into clusters and represents them in the matrix representations to make it easy to see connective subsets.

Published in:

Information Visualisation (IV), 2011 15th International Conference on

Date of Conference:

13-15 July 2011