Skip to main content
SpringerLink
Log in

Enhancement of Minimum Spanning Tree

  • Conference paper
  • First Online:
Proceedings of International Conference on ICT for Sustainable Development

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

Abstract

Importance of minimum spanning tree is used to find the smallest path which includes all the nodes in the network. Minimum spanning tree can be obtained using classical algorithms such as, Boruvka’s, Prim’s, and Kruskal. This research paper contains a survey on the classical and recent algorithms which used different techniques to find minimum spanning tree. This research paper includes a new method to generate a Minimum Spanning Tree. It also contains comparisons of Minimum Spanning Tree algorithms with new proposed algorithms and its simulation results.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. (2009). Introduction to algorithms (3rd ed., pp. 624–642). PHI Learning Private Ltd.

    Google Scholar 

  2. Mehlhorn, K., & Peter, S. (2008). Algorithms and data structures: The basic toolbox. Springer.

    Google Scholar 

  3. Wu, B. Y., & Chao, K.-M. (2004). Spanning trees and optimization problems. CRC Press.

    Google Scholar 

  4. Motwani, R., & Raghavan, P. (2010). Randomized algorithms. Chapman & Hall/CRC.

    Google Scholar 

  5. Nesetril, J., Nesetrilova, H., & Milkovs, E. (2001). Otakar Boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics, 233(1), 3–36.

    Article  MathSciNet  MATH  Google Scholar 

  6. Hassan, M. R. (2012). An efficient method to solve least-cost minimum spanning tree (LC-MST) problem. Journal of King Saud University—Computer and Information Sciences, 24, 101–105.

    Article  Google Scholar 

  7. Dagar, S. (2012). Modified prim’s algorithm. IJCIT, 03(02). ISSN:2218-5224.

    Google Scholar 

  8. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and traveling salesman problem. Proceedings of the American Mathematical Society, 7, 48–50.

    Google Scholar 

  9. Bazlamacci, F., Hindi, K. S., & Cuneyt. (2001). Minimum-weight spanning tree algorithms a survey and empirical study. Computers & Operations Research, 28(8), 767–785.

    Google Scholar 

  10. Eisner, J. (1997). State of the art algorithms for minimum spanning trees a tutorial discussion.

    Google Scholar 

  11. Mandal, A., Dutta, J., & Pal, S. C. (2012). A new efficient technique to construct a minimum spanning tree. International Journal, 2(10).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, R K University, Rajkot, India

    Nimesh Patel & K. M. Patel

Authors
  1. Nimesh Patel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. M. Patel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nimesh Patel .

Editor information

Editors and Affiliations

  1. Dept of Comp Sci Engg, Anil Neerukonda Ins Tech & Sci, Visakhapatnam, Andhra Pradesh, India

    Suresh Chandra Satapathy

  2. Sabarkantha, Sabar Institute of Technology, Sabarkantha, Gujarat, India

    Amit Joshi

  3. Studies and Management, Narsinhbhai Institute of Computer, Kadi, Gujarat, India

    Nilesh Modi

  4. Computer Studies and Management, Narsinhbhai Institute of, Kadi, Gujarat, India

    Nisarg Pathak

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Patel, N., Patel, K.M. (2016). Enhancement of Minimum Spanning Tree. In: Satapathy, S., Joshi, A., Modi, N., Pathak, N. (eds) Proceedings of International Conference on ICT for Sustainable Development. Advances in Intelligent Systems and Computing, vol 408. Springer, Singapore. https://doi.org/10.1007/978-981-10-0129-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0129-1_10

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0127-7

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation