An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization

Authors:
Vida Dujmovic;Sue Whitesides
Affiliations:
School of Computer Science, McGill University, 3480 University Street, Montreal, Québec, H3A 2A7, Canada;School of Computer Science, McGill University, 3480 University Street, Montreal, Québec, H3A 2A7, Canada
Venue:
Algorithmica
Year:
2004

Citing 0
Cited 6

Eliminating wire crossings for molecular quantum-dot cellular automata implementation

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Fixed parameter algorithms for one-sided crossing minimization revisited

Journal of Discrete Algorithms
Comparing trees via crossing minimization

Journal of Computer and System Sciences
Ranking and drawing in subexponential time

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
2-Layer right angle crossing drawings

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(φk · n2) fixed parameter tractable algorithm for the 1-Sided Crossing Minimization. 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 allowed edge crossings.