The assignment heuristic for crossing reduction

Abstract

Several applications use algorithms for drawing k-layered networks and, in particular, 2-layered networks (i.e. bipartite graphs). Bipartite graphs are commonly drawn in the plane so that all vertices lie on two parallel vertical lines, and an important requirement in drawing such graphs is to minimize edge crossings. Such a problem is NP-complete even when the position of the vertices on one layer is held fixed. This paper presents a heuristic, called the assignment heuristic, for edge crossing minimization in bipartite graphs, which works by reducing the problem to an assignment problem. The main idea of the assignment heuristic is to position simultaneously all the vertices of one layer, so that the mutual interaction of the position of all the vertices can be taken into account. We also show that the idea underlying the assignment heuristic can be effectively applied in other cases requiring edge crossing minimization.<>