A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs

Zevi Miller, Ivan Hal Sudborough. A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. In Fillia Makedon, Kurt Mehlhorn, Theodore S. Papatheodorou, Paul G. Spirakis, editors, VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings. Volume 227 of Lecture Notes in Computer Science, pages 252-260, Springer, 1986.

@inproceedings{MillerS86,
  title = {A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs},
  author = {Zevi Miller and Ivan Hal Sudborough},
  year = {1986},
  researchr = {https://researchr.org/publication/MillerS86},
  cites = {0},
  citedby = {0},
  pages = {252-260},
  booktitle = {VLSI Algorithms and Architectures, Aegean Workshop on Computing, Loutraki, Greece, July 8-11, 1986, Proceedings},
  editor = {Fillia Makedon and Kurt Mehlhorn and Theodore S. Papatheodorou and Paul G. Spirakis},
  volume = {227},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-16766-8},
}