An Efficient Fixed Parameter Tractable Algorithm for 1Sided Crossing MinimizationDujmović, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1Sided Crossing Minimization. In: Graph Drawing 10th International Symposium, GD 2002, August 2628, 2002 , pp. 118129(Official URL: http://dx.doi.org/10.1007/3540361510_12). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540361510_12
AbstractWe give an O(øk · n 2) algorithm for the 1SIDED CROSSING MINIMIZATION problem, thus showing that the problem is Fixed Parameter Tractable. The constant \phi in the running time is the golden ratio \phi=\frac{1+\sqrt{5}}{2}\approx 1.618. The constant k is the parameter of the problem: the number of allowed edge crossings.
Actions (login required)
