Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi. Fast edge splitting and Edmonds arborescence construction for unweighted graphs. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 455-464, SIAM, 2008. [doi]
@inproceedings{BhalgatHKP08, title = {Fast edge splitting and Edmonds arborescence construction for unweighted graphs}, author = {Anand Bhalgat and Ramesh Hariharan and Telikepalli Kavitha and Debmalya Panigrahi}, year = {2008}, doi = {10.1145/1347082.1347132}, url = {http://doi.acm.org/10.1145/1347082.1347132}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/BhalgatHKP08}, cites = {0}, citedby = {0}, pages = {455-464}, booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}, editor = {Shang-Hua Teng}, publisher = {SIAM}, }