Work place: Department of Computer Science and Engineering, University of Calcutta, Kolkata, India
E-mail: sssarma2010@gmail.com
Website:
Research Interests: Applied computer science, Computational Science and Engineering, Computer systems and computational processes, Theoretical Computer Science
Biography
Samar Sen Sarma: Professor of Department of Computer Science and Engineering in University of Calcutta, Kolkata. Author has published two books, and having eighty publications in different international /national journals, and more than forty years of academic and research experience.
By Sanjay Kumar Pal Samar Sen Sarma
DOI: https://doi.org/10.5815/ijitcs.2013.09.08, Pub. Date: 8 Aug. 2013
This paper is approaching a new technique of creating Minimal Spanning Trees based on degree constraints of a simple symmetric and connected graph G. Here we recommend a new algorithm based on the average degree sequence factor of the nodes in the graph. The time complexity of the problem is less than O(N log|E|) compared to the other existing time complexity algorithms is O(|E| log|E|)+C of Kruskal, which is optimum. The goal is to design an algorithm that is simple, graceful, resourceful, easy to understand, and applicable in various fields starting from constraint based network design, mobile computing to other field of science and engineering.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals