Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. Heggernes, P., van 't Hof, P., Lokshtanov, D., & Nederlof, J. SIAM J. Discrete Math. (SIAMDM), 26(3):1008-1021, 2012.
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time [link]Paper  bibtex   
@article{ dblp2621636,
  title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
  author = {Pinar Heggernes and Pim van 't Hof and Daniel Lokshtanov and Jesper Nederlof},
  author_short = {Heggernes, P. and van 't Hof, P. and Lokshtanov, D. and Nederlof, J.},
  bibtype = {article},
  type = {article},
  year = {2012},
  key = {dblp2621636},
  id = {dblp2621636},
  biburl = {http://www.dblp.org/rec/bibtex/journals/siamdm/HeggernesHLN12},
  url = {http://dx.doi.org/10.1137/110830514},
  journal = {SIAM J. Discrete Math. (SIAMDM)},
  pages = {1008-1021},
  number = {3},
  volume = {26},
  text = {SIAM J. Discrete Math. (SIAMDM) 26(3):1008-1021 (2012)}
}

Downloads: 0