Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki. Bisecting Two Subsets in 3-Connected Graphs. In Alok Aggarwal, C. Pandu Rangan, editors, Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings. Volume 1741 of Lecture Notes in Computer Science, pages 425-434, Springer, 1999. [doi]
@inproceedings{NagamochiJNI99,
title = {Bisecting Two Subsets in 3-Connected Graphs},
author = {Hiroshi Nagamochi and Tibor Jordán and Yoshitaka Nakao and Toshihide Ibaraki},
year = {1999},
url = {http://link.springer.de/link/service/series/0558/bibs/1741/17410425.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/NagamochiJNI99},
cites = {0},
citedby = {0},
pages = {425-434},
booktitle = {Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings},
editor = {Alok Aggarwal and C. Pandu Rangan},
volume = {1741},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-66916-7},
}