Skip to main content
SpringerLink
Log in

A Divide-and-Conquer Algorithm for All Spanning Tree Generation

  • Chapter
  • First Online:
Advanced Computing and Systems for Security

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 567))

Abstract

This paper claims to propose a unique solution to the problem of all possible spanning tree enumeration for a simple, symmetric, and connected graph. It is based on the algorithmic paradigm named divide-and-conquer. Our algorithm proposes to perform no duplicate tree comparison and a minimum number of circuit testing, consuming reasonable time and space.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Divide-and-Conquer: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge, Massachusetts (2009)

    MATH  Google Scholar 

  2. Berger, I.: The Enumeration of Trees without Duplication. IEEE Trans. Circuit Theor. 14(4), 417–418 (1967)

    Article  Google Scholar 

  3. Char, J.P.: Generation of trees, two-trees, and storage of master forests. IEEE Trans. Circuit Theor. 15(3), 228–238 (1968)

    Article  MathSciNet  Google Scholar 

  4. Gabow, H.N., Myers, E.W.: Finding all spanning trees of directed and undirected graphs. SIAM J. Comput. 7(3), 280–287 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  5. McElroy, M.D.: Algorithm 354: generator of spanning trees [H]. Commun. ACM 12(9), 511 (1969)

    Article  Google Scholar 

  6. Naskar, S., Basuli, K., Sen Sarma, S.: Generation of all spanning trees of a simple, symmetric, connected graph. In: National Seminar on Optimization Technique, Department of Applied Mathematics, University of Calcutta, p. 27 (2007)

    Google Scholar 

  7. Naskar, S., Basuli, K., Sen Sarma, S.: Generation of All Spanning Trees. Social Science Research Network (2009)

    Google Scholar 

  8. Naskar, S., Basuli, K., Sen Sarma, S.: Generation of all spanning trees in the limelight. In: Advances in Computer Science and Information Technology, Second International Conference, CCSIT 2012, Bangalore, vol. 86, pp. 188–192. Proceedings Part III published by Springer (2012)

    Google Scholar 

  9. Piekarski, M.: Listing of all possible trees of a linear graph. IEEE Trans. Circuit Theor. 12(1), 124–125 (1965)

    Article  Google Scholar 

  10. Sen Sarma, S., Rakshit, A., Sen, R.K., Choudhury, A.K.: An efficient tree generation algorithm. J. Inst. Electron. Telecommun. Eng. 27(3), 105–109 (1981)

    Google Scholar 

  11. Trent, H.M.: Note on the enumeration and listing of all possible trees in a connected linear graph. In: Proceedings of the National Academy of Sciences. USA.40, pp. 1004 (1954)

    Google Scholar 

  12. Cherkasskii, B.V.: New algorithm for generation of spanning trees. Cybern. Syst. Anal. 23(1), 107–113 (1987)

    Article  MathSciNet  Google Scholar 

  13. Hakimi, S.L.: On trees of a graph and their generation. J. Franklin Inst. 272(5), 347–359 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kapoor, S., Ramesh, H.: Algorithms for enumerating all spanning trees of undirected and weighted graphs. SIAM J. Comput. 24(2), 247–265 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Matsui, T.: An algorithm for finding all the spanning trees in undirected graphs. In: METR93-08, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo. 16, pp. 237–252 (1993)

    Google Scholar 

  16. Matsui, T.: A flexible algorithm for generating all the spanning trees in undirected graphs. Algorithmica 18(4), 530–543 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mayeda, W., Seshu, S.: Generation of trees without duplications. IEEE Trans. Circuit Theor. 12(2), 181–185 (1965)

    Article  MathSciNet  Google Scholar 

  18. Shioura, A., Tamura, A.: Efficiently scanning all spanning trees of an undirected graph. In: Research Report: B-270, Department of Information Sciences, Tokyo Institute of Technology, Tokyo. (1993)

    Google Scholar 

  19. Shioura, A., Tamura, A., Uno, T.: An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J. Comput. 26(3), 678–692 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  20. Minty, G.: A simple algorithm for listing all the trees of a graph. IEEE Trans. Circuit Theor. 12(1), 120-120 (1965)

    Article  Google Scholar 

  21. Smith, M.J.: Generating spanning trees. In: MS Thesis, Department of Computer Science, University of Victoria (1997)

    Google Scholar 

  22. Winter, P.: An algorithm for the enumeration of spanning trees. BIT Numer. Math. 26(1), 44–62 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Institute of Engineering and Management, Y-12, Block-EP, Sector-V, Salt Lake, Kolkata, India

    Maumita Chakraborty

  2. Subex, Inc., 12303 Airport Way, Suite 390, Broomfield, CO, 80021, USA

    Ranjan Mehera

  3. Department of Computer Science and Engineering, University of Calcutta, JD-2, Sector III, Salt Lake, Kolkata, India

    Rajat Kumar Pal

Authors
  1. Maumita Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ranjan Mehera
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rajat Kumar Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maumita Chakraborty .

Editor information

Editors and Affiliations

  1. A.K. Choudhury School of Information Tec, Associate Prof., University of Calcutta A.K. Choudhury School of Information Tec, Kolkata, West Bengal, India

    Rituparna Chaki

  2. Faculty of Computer Science, Bialystok University of Technology Faculty of Computer Science, Bialystok, Poland

    Khalid Saeed

  3. DAIS—Università Ca' Foscari, Full Professor of Computer Science DAIS—Università Ca' Foscari, Mestre, Venice, Venezia, Italy

    Agostino Cortesi

  4. Computer Science & Engineering, University of Calcutta Computer Science & Engineering, Kolkata, West Bengal, India

    Nabendu Chaki

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Chakraborty, M., Mehera, R., Pal, R.K. (2017). A Divide-and-Conquer Algorithm for All Spanning Tree Generation. In: Chaki, R., Saeed, K., Cortesi, A., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 567. Springer, Singapore. https://doi.org/10.1007/978-981-10-3409-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3409-1_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3408-4

  • Online ISBN: 978-981-10-3409-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation