论文信息 - On drawing regular bipartite graphs

On drawing regular bipartite graphs

This paper deals with heuristics for drawing bipartite graphs in the case the vertices to be ordered have a common degree. These graphs are called regular bipartite graphs. Our main result states that two completely different heuristics, the barycenter heuristic and the assignment heuristic, coincide on regular bipartite graphs.

Erkki Mäkinen

[1] Erkki Mäkinen,et al. Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..

[2] Mitsuhiko Toda,et al. Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[3] Erkki Mäkinen. Remarks on the assignment heuristic for drawing bipartite graphs , 1990 .