Hiroshi Nagamochi, Toshihide Ibaraki. A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. In Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger, editors, Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings. Volume 1610 of Lecture Notes in Computer Science, pages 377-390, Springer, 1999. [doi]
@inproceedings{NagamochiI99:0,
title = {A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts},
author = {Hiroshi Nagamochi and Toshihide Ibaraki},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1610/16100377.htm},
researchr = {https://researchr.org/publication/NagamochiI99%3A0},
cites = {0},
citedby = {0},
pages = {377-390},
booktitle = {Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings},
editor = {Gérard Cornuéjols and Rainer E. Burkard and Gerhard J. Woeginger},
volume = {1610},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66019-4},
}