Drawing Semi-bipartite Graphs in Anchor+Matrix Style

Kazuo Misue, Qi Zhou
2011 2011 15th International Conference on Information Visualisation  
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
more » ... ended 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.
doi:10.1109/iv.2011.24 dblp:conf/iv/MisueZ11 fatcat:6exfh3nilvczpau67w2myjcfr4