Farhan Banu
Abstract
Open-access reader
This paper is concerned with Minimum Spanning Tree problem, a fundamental problem of Network modeling. Here we have proposed a novel approach to determine minimum spanning tree of an undirected connected network which is also demonstrated with numerical example
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper is concerned with Minimum Spanning Tree problem, a fundamental problem of Network modeling. Here we have proposed a novel approach to determine minimum spanning tree of an undirected connected network which is also demonstrated with numerical example
Key concepts: Spanning tree, Minimum spanning tree, Distributed minimum spanning tree, Euclidean minimum spanning tree, Connected dominating set, Kruskal's algorithm, k-minimum spanning tree, Minimum degree spanning tree