Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9, 507–537 (1988)
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)
Even, S.: Graph Algorithms. Computer Science Press, Potomac (1979)
Huck, A.: Independent trees in Graphs. Graphs and Combinatorics 10, 29–45 (1994)
Itai, A., Rodeh, M.: The multi-tree approach to reliability in distributed networks. Information and Computation 79, 43–59 (1988)
Kant, G., He, X.: Two algorithms for finding rectangular duals of planar graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 396–410. Springer, Heidelberg (1994)
Khuller, S., Schieber, B.: On independent spanning trees. Information Processing Letters 42, 321–323 (1992)
Nakano, S., Rahman, M.S., Nishizeki, T.: A linear time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters 62, 315–322 (1997)
Obokata, K., Iwasaki, Y., Bao, F., Igarashi, Y.: Independent spanning trees of product graphs and their construction. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 338–351. Springer, Heidelberg (1997)
Zehavi, A., Itai, A.: Three tree-paths. J. Graph Theory 13, 175–188 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miura, K., Takahashi, D., Nakano, Si., Nishizeki, T. (1998). A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. In: Hromkovič, J., Sýkora, O. (eds) Graph-Theoretic Concepts in Computer Science. WG 1998. Lecture Notes in Computer Science, vol 1517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692760_25
Download citation
DOI: https://doi.org/10.1007/10692760_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65195-6
Online ISBN: 978-3-540-49494-2
eBook Packages: Springer Book Archive