A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
1999 ◽
Vol 10
(02)
◽
pp. 195-210
◽
Keyword(s):
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 the k paths connecting r and any vertex v in the k trees are internally disjoint. In this paper we give a linear-time algorithm to find four independent spanning trees in a 4-connected planar graph.
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1996 ◽
Vol 07
(02)
◽
pp. 95-110
◽
Keyword(s):
2006 ◽
Vol 36
(2)
◽
pp. 283-311
◽
Keyword(s):
1997 ◽
Vol 62
(6)
◽
pp. 315-322
◽
Keyword(s):
1997 ◽
Vol 07
(03)
◽
pp. 211-223
◽
Keyword(s):