1,721,113 research outputs found
The Assignment Heuristic for Crossing Reduction
No full textSeveral 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
Once upon a Time, in a Computer Engineering Department ...
No full textWhen you decide to pursue a career in the academy, you may encounter many difficulties, obstacles, and moments of discouragement, but also have great satisfaction, exaltation, and a lot of fun. By the time you get to the mid-career period, many doubts and problems are behind you (if you are still in the academy and did not give up) and a less stressful time begins with even more freedom to study, create your own group, and choose your own ventures. This is also the time when you may decide to impact the society, not just work for yourself, but do it to contribute to the creation of a better world and be a positive example for the younger generation
- …
