Learn More
The bipartite crossing number problem is studied and a connection between this problem and the linear arrangement problem is established. A lower bound and an upper bound for the optimal number of crossings are derived, where the main terms are the optimal arrangement values. Two polynomial time approximation algorithms for the bipartite crossing number are(More)
The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximized. The problem was originally introduced in [15] in connection with multiprocessor scheduling problems and can be also understood as a dual problem to the well known bandwidth(More)
Let G be a connected bipartite graph.We give a short proof, using a variation of Menger's Theorem, for a new lower bound which relates the bipartite crossing number of G, denoted by bcr(G), to the edge connectivity properties of G. The general lower bound implies a weaker version of a very recent result, establishing a bisection based lower bound on bcr(G)(More)
The cutwidth problem is to nd a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. The main question is to compare both measures cw and ccw for speciic networks, whether adding an edge(More)