A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs

Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki. A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. In COCOON. pages 164-173, 1999. [doi]

@inproceedings{NagamochiKI99,
  title = {A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs},
  author = {Hiroshi Nagamochi and Shigeki Katayama and Toshihide Ibaraki},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1627/16270164.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/NagamochiKI99},
  cites = {0},
  citedby = {0},
  pages = {164-173},
  booktitle = {COCOON},
}