A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
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 four independent spanning trees in a 4-connected planar graph rooted at any vertex.
Unable to display preview. Download preview PDF.
- Bao, F., Igarashi, Y.: Reliable broadcasting in product networks with By-zantime faults. In: Proc. 26th Annual International Symposium on Fault-Tolelant Computing (FTCS 1996), pp. 262–271 (1996)Google Scholar
- Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Technical Report CS-96-25, Department of Computer Science, Brown University (1996)Google Scholar
- Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Technical Report RUU-CS-93-45, Department of Computer Science, Utrecht University (1993)Google Scholar
- Dolev, D., Halpern, J.Y., Simons, B., Strong, R.: A new look at fault tolerant network routing. In: Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 526–535 (1984)Google Scholar