Skip to main content
SpringerLink
Log in

Finding Independent Spanning Trees in Partial k-Trees

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1969))

Included in the following conference series:

  • 709 Accesses

Abstract

Spanning trees rooted at a vertex r of a graph G are independent if, for each vertex v in G, all the paths connecting v and r in the trees are pairwise internally disjoint. In this paper we give a linear-time algorithm to find the maximum number of independent spanning trees rooted at any given vertex r in partial k-trees G, that is, graphs G with tree-width bounded by a constant k.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bao and Y. Igarashi. Reliable broadcasting in product networks with byzantine faults. In Proceedings of the 26th Ann. Int. Symp. Fault-Tolerant Computing (FTCS’96), pp. 262–271, 1996.

    Google Scholar 

  2. H. L. Bodlaender. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, 11(4):631–643, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  3. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25:1305–1317, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. L. Bodlaender and T. Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. In Proc. of the 22nd International Colloquium on Automata, Languages and Programming, LNCS, 944, pp. 268–279, 1995.

    Google Scholar 

  5. J. Cheriyan and S.N. Maheshwari. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. of Algorithms, 9:507–537, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Huck. Independent trees in graphs. Graphs & Combin., 10:29–45, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Huck. Independent trees in graphs. Manuscript, Institut für Mathematik, Universität Hannover, 1996.

    Google Scholar 

  8. A. Itai and M. Rodeh. The multi-tree approach to reliability in distributed networks. Inform. and Comput., 79:43–59, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  9. Y. Iwasaki, Y. Kajiwara, K. Obokata, and Y. Igarashi. Independent spanning trees of chordal rings. Information Processing Letters, 69:155–160, 1999.

    Article  MathSciNet  Google Scholar 

  10. S. Khuller and B. Schieber. Routing through a generalized switchbox. Information Processing Letters, 42:321–323, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  11. K. Miura, D. Takahashi, S. Nakano, and T. Nishizeki. A linear-time algorithm to find four independent spanning trees in four-connected planar graphs. International Journal of Foundations of Computer Science, 10:195–210, 1999.

    Article  MathSciNet  Google Scholar 

  12. K. Obokata, Y. Iwasaki, F. Bao, and Y. Igarashi. Independent spanning trees of product graphs. In Proc. of the 22nd International Workshop on Graph-Throretic Concepts in Computer Science, LNCS, 1197, pp. 338–351, 1996.

    Google Scholar 

  13. A. Zehavi and A. Itai. Three tree-paths. J. Graph Theory, 13:175–188, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  14. X. Zhou, S. Tamura, and T. Nishizeki. Finding edge-disjoint paths in partial k-trees. Algorithmica, 26:3–30, 2000.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Aoba-yama 05, 980-8579, Sendai, JAPAN

    Xiao Zhou & Takao Nishizeki

Authors
  1. Xiao Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takao Nishizeki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Karlsruhe University, Germany

    Gerhard Goos

  2. Cornell University, NY, USA

    Juris Hartmanis

  3. Utrecht University, The Netherlands

    Jan van Leeuwen

  4. Academia Sinica, Institute of Information Science, 128 Academia Road, Section 2, Nankang, 115, Taipei, Taiwan, R.O.C.

    D. T. Lee

  5. Department of Computer Science and Akamai Technologies, University of Illinois at Urbana Champaign, 500 Technology Square, 02139, Cambridge, MA, USA

    Shang-Hua Teng

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, X., Nishizeki, T. (2000). Finding Independent Spanning Trees in Partial k-Trees. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-40996-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41255-7

  • Online ISBN: 978-3-540-40996-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation