Pentti A. Honkanen
ABSTRACT
When a system or process is represented as a graph and a unique interconnection between the quantities is desired the problem is one of selecting a spanning tree. Each spanning tree gives a unique path between vertices, but there are many spanning trees for a graph.
An algorithm for the selection of a minimal spanning tree for a given weighted connected graph, or a minimal spanning forest for a disconnected weighted graph is presented. The algorithm utilizes sparse matrix techniques, and the basic concept of ring sum operations to obtain the spanning tree, or forest. The minimality of the resultant spanning tree, or forest is proven. In addition, timing and storage requirements are determined. Several cases are studied including the worst case. The only restriction placed on the graphs is that they do not have any isolated vertices.
- Berztiss, Data Structures Theory and Practice, Academic Press, New York, 1975.Google Scholar
- Busacker & Saaty, <Finite Graphs and Networks, McGraw-Hill, New York, 1965.Google Scholar
- Elson, Data Structures, SRA, Chicago, Ill., 1975.Google Scholar
- Knuth, The Art of Computer Programming, Vol. 1, Addison Wesley, Reading, Mass., 1974.Google Scholar
- Knuth, The Art of Computer Programming, Vol. III, Addison Wesley, Reading, Mass., 1973.Google Scholar
- Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, N.Y., 1960.Google Scholar
Index Terms
- A fast minimal storage computational algorithm for determining a minimal spanning tree in a graph
Recommendations
Algorithm 422: minimal spanning tree [H]
This algorithm generates a spanning tree of minimal total edge length for an undirected graph specified by an array of inter-node edge lengths using a technique suggested by Dijkstra [1]. Execution time is proportional to the square of the number of ...
Degree-bounded minimum spanning tree for unit disk graph
Degree-bounded minimum spanning tree (DBMST) has been widely used in many applications of wireless sensor networks, such as data aggregation, topology control, etc. However, before construction of DBMST, it is NP-hard to determine whether or not there ...
A Unified Proof for Finding a Minimal Spanning Tree
ICoMS '20: Proceedings of the 2020 3rd International Conference on Mathematics and StatisticsFinding a minimal spanning tree (MST) has attracted a lot of researchers. There are many approaches and ways to find a MST of a network. In this article, we demonstrate a systematic approach based on natural induction over the set of nodes to reach a ...
Comments