Two New Heuristics for Two-Sided Bipartite Graph Drawing

Abstract

Two new heuristic strategies are studied based on heuristics for the linear arrangement problem and a stochastic hill-climbing method for the two-sided bipartite crossing number problem. These are compared to the standard heuristic for two-sided bipartite drawing based on iteration of the barycentre method. Our experiments show that they can efficiently find good solutions.

Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D

“…In CAMs or two-sided graphs [5], we only consider the order of nodes. CAMs decide the order of anchors on the circumference (in other words, on the vertices of a regular polygon) by running an algorithm.…”

“…Giacomo et al [4] proposed drawing bipartite graphs on two curves so that the edges do not cross. Newton et al [5] proposed new heuristics for two-sided bipartite graph drawing. We describe a new visualization technique for large-scale bipartite graphs to maintain high readability.…”

“…Visualizing this information is an efficient method of analysis. However, conventional visualization techniques for bipartite graphs [1][2][3][4][5] do not provide enough readability for drawing large-scale graphs.…”

Anchored Map: Graph Drawing Technique to Support Network Mining

“…There are some research results related to techniques for drawing bipartite graphs [2], [5], [12], [14], but most of them put their focus on theoretical aspects such as planar layout and edge-crossing minimization. Applicationoriented techniques for drawing bipartite graphs have not been studied much.…”

Confluent Layered Drawings

“…Jünger and Mutzel [16] present exact algorithms for this problem, and perform experimental comparison of their results with various heuristic methods. Recently new methods related to crossing reduction ( [26,1,8,23,10]) have been proposed.…”