Abstract
This paper shows generation of minimal spanning trees based on two constraints, namely degree constraint and node weightage, of a simple symmetric and connected graph G. A new algorithm is proposed here to find out the minimal spanning tree of graph G based on the average degree sequence factor of the nodes of the graph. The time complexity of the problem is less than O(N log |E|) compared with the existing algorithms' time complexity, O(|E| log |E|) + C of the Kruskal algorithm, which is optimum. The goal is to design an algorithm that is simple, elegant, efficient, easy to understand and applicable in the field of special areas like constraint-based network design, mobile computing with specific criteria and other special applications in the field of engineering and science.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Research on Information Technology and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
