One Sided Crossing Minimization Is NP-Hard for Sparse Graphs
نویسندگان
چکیده
The one sided crossing minimization problem consists of placing the vertices of one part of a bipartite graph on prescribed positions on a straight line and finding the positions of the vertices of the second part on a parallel line and drawing the edges as straight lines such that the number of pairwise edge crossings is minimized. This problem represents the basic building block used for drawing hierarchical graphs aesthetically or producing row-based VLSI layouts. Eades and Wormald [3] showed that the problem is NP-hard for dense graphs. Typical graphs of practical interest are usually very sparse. We prove that the problem remains NP-hard even for forests of 4-stars.
منابع مشابه
New Exact Algorithms for the Two-Sided Bipartite Crossing Minimization Problem
The Two-sided Two-layer Crossing Minimization (TSCM) problem calls for minimizing a quadratic objective function subject to a set of ordering constraints, where all variables are binary. This NP-hard problem has important applications in graph drawing as a key step in drawing hierarchical graphs. In this paper, we propose two new exact algorithms for the TSCM problem. One is an LP-based branch-...
متن کاملA Generalized Framework for[1ex] Drawing Directed Graphs
The most popular method of drawing directed graphs is to place vertices on a setof horizontal or concentric levels, known as level drawings. Level drawings are wellstudied in Graph Drawing due to their strong application for the visualization ofhierarchy in graphs. There are two drawing conventions: horizontal drawings use aset of parallel lines and radial drawings use a set...
متن کاملGlobal k-Level Crossing Reduction
Directed graphs are commonly drawn by a four phase framework introduced by Sugiyama et al. in 1981. The vertices are placed on parallel horizontal levels. The edge routing between consecutive levels is computed by solving one-sided 2-level crossing minimization problems, which are repeated in up and down sweeps over all levels. Crossing minimization problems are generally NP-hard. We introduce ...
متن کاملExact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is xed, even though the problem is NP-hard, and that for the general problem with two variable layers, true optima can be computed for sparse instances in which the smaller ...
متن کاملNew Approximation to the One-sided Radial Crossing Minimization
In this paper, we study a crossing minimization problem in a radial drawing of a graph. Radial drawings have strong application in social network visualization, for example, displaying centrality indices of actors [20]. The main problem of this paper is called the one-sided radial crossing minimization between two concentric circles, named orbits, where the positions of vertices in the outer or...
متن کامل