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]
Abstract is missing.