Finding a Dense Subgraph with Sparse Cut.

@inproceedings{miyauchi-2018-finding, author = {Atsushi Miyauchi and Naonori Kakimura}, editor = {Alfredo Cuzzocrea and James Allan and Norman W. Paton and Divesh Srivastava and Rakesh Agrawal and Andrei Z. Broder and Mohammed J. Zaki and K. Sel\c{c}uk Candan and Alexandros Labrinidis and Assaf Schuster and Haixun Wang}, title = {{Finding a Dense Subgraph with Sparse Cut}}, booktitle = {{Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, Torino, Italy, October 22-26, 2018}}, pages = {547--556}, publisher = {ACM}, year = {2018}, url = {https://doi.org/10.1145/3269206.3271720}, doi = {https://doi.org/10.1145/3269206.3271720} }