Google Research

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

Abstract

No abstract available; check out the Download or Google Scholar links above for publications details.

Learn more about how we do research

We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work