Linear Time Algorithms for k-cutwidth Problem

Maw-Hwa Chen, Sing-Ling Lee. Linear Time Algorithms for k-cutwidth Problem. In Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, editors, Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings. Volume 650 of Lecture Notes in Computer Science, pages 21-30, Springer, 1992.

@inproceedings{ChenL92:6,
  title = {Linear Time Algorithms for k-cutwidth Problem},
  author = {Maw-Hwa Chen and Sing-Ling Lee},
  year = {1992},
  researchr = {https://researchr.org/publication/ChenL92%3A6},
  cites = {0},
  citedby = {0},
  pages = {21-30},
  booktitle = {Algorithms and Computation, Third International Symposium, ISAAC  92, Nagoya, Japan, December 16-18, 1992, Proceedings},
  editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita},
  volume = {650},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-56279-6},
}