Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat. An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. In David S. Johnson, Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. pages 605-614, ACM, 2007. [doi]
@inproceedings{HariharanKPB07,
title = {An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs},
author = {Ramesh Hariharan and Telikepalli Kavitha and Debmalya Panigrahi and Anand Bhalgat},
year = {2007},
doi = {10.1145/1250790.1250879},
url = {http://doi.acm.org/10.1145/1250790.1250879},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HariharanKPB07},
cites = {0},
citedby = {0},
pages = {605-614},
booktitle = {Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007},
editor = {David S. Johnson and Uriel Feige},
publisher = {ACM},
isbn = {978-1-59593-631-8},
}