Introduction to algorithms
Theoretical Computer Science
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Revised Papers from the 9th International Symposium on Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
A Fixed-Parameter Approach to Two-Layer Planarization
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
On the Parameterized Complexity of Layered Graph Drawing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Parameterized Complexity
On the one-sided crossing minimization in a bipartite graph with large degrees
Theoretical Computer Science
| Hi-index | 0.00 |
We give an O(驴k 驴 n2) algorithm for the 1-SIDED CROSSING MINIMIZATION problem, thus showing that the problem is Fixed Parameter Tractable. The constant 驴 in the running time is the golden ratio 驴 = 1+驴5/2 驴 1.618. The constant k is the parameter of the problem: the number of alloweded ge crossings.