A faster fixed parameter algorithm for two-layer crossing minimization

@article{Kobayashi2016AFF,
  title={A faster fixed parameter algorithm for two-layer crossing minimization},
  author={Yasuaki Kobayashi and Hisao Tamaki},
  journal={Inf. Process. Lett.},
  year={2016},
  volume={116},
  pages={547-549}
}
We give an algorithm that decides whether the bipartite crossing number of a given graph is at most k. The running time of the algorithm is upper bounded by 2 + n, where n is the number of vertices of the input graph, which improves the previously known algorithm due to Kobayashi et al. (TCS 2014) that runs in 2 log +n time. This result is based on a… CONTINUE READING