Sayaka Nagai

Learn More
SUMMARY Given a graph G, a designated vertex r and a natural number k, we wish to find k " independent " spanning trees of G rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find k independent spanning trees in a(More)
  • 1