Jump to Content

Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs

Anand Bhalgat
Ramesh Hariharan
Telikepalli Kavitha
Debmalya Panigrahi
Proc. ACM-SIAM Symposium on Discrete Algorithms, SIAM, San Francisco (2008), pp. 455-464
Google Scholar

Abstract