Skip to main content
Conference ProceedingsOPEN ACCESS

An efficient fixed parameter tractable algorithm for 1-Sided Crossing Minimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2528 LNCS 118-129
DOI: 10.1007/3-540-36151-0_12
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 allowededge crossings. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Dujmović, V., & Whitesides, S. (2002). An efficient fixed parameter tractable algorithm for 1-Sided Crossing Minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 118–129). Springer Verlag. https://doi.org/10.1007/3-540-36151-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free