Skip to main content
SpringerLink
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 3480 University Street, Montreal, Québec, H3A 2A7, Canada

    Vida Dujmovic & Sue Whitesides

Authors
  1. Vida Dujmovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sue Whitesides
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Vida Dujmovic or Sue Whitesides.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dujmovic, V., Whitesides, S. An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica 40, 15–31 (2004). https://doi.org/10.1007/s00453-004-1093-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-004-1093-2

Search

Navigation