论文信息 - A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs

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.

[1] Takao Nishizeki,et al. Planar Graphs: Theory and Algorithms , 1988 .

[2] Danny Dolev,et al. A new look at fault tolerant network routing , 1984, STOC '84.

[3] M. Chrobak,et al. Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[4] Samir Khuller,et al. On Independent Spanning Trees , 1992, Inf. Process. Lett..

[5] Yoshihide Igarashi,et al. Independent Spanning Trees of Product Graphs , 1996, WG.

[6] Koji Obokata,et al. Independent Spanning Trees of Product Graphs and Their Construction , 1996 .

[7] Shin-Ichi Nakano,et al. A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs , 1996, Inf. Process. Lett..

[8] Shimon Even,et al. Graph Algorithms , 1979 .

[9] Roberto Tamassia,et al. Output-Sensitive Reporting of Disjoint Paths (Extended Abstract) , 1996, COCOON.

[10] S. N. Maheshwari,et al. Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.

[11] Goos Kant,et al. Two Algorithms for Finding Rectangular Duals of Planar Graphs , 1993, WG.

[12] Alon Itai,et al. Three tree-paths , 1989, J. Graph Theory.

[13] Andreas Huck. Independent trees in graphs , 1994, Graphs Comb..

[14] Alon Itai,et al. The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[15] Roberto Tamassia,et al. Output-Sensitive Reporting of Disjoint Paths , 1996, Algorithmica.