Formal Procedures for Connecting Terminals with a Minimum Total Wire Length
Journal of the ACM (JACM)
Matrix computations with Fortran and paging
Communications of the ACM
From latent semantics to spatial hypertext—an integrated approach
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Algorithm 479: A minimal spanning tree clustering method
Communications of the ACM
Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights
ACM Transactions on Mathematical Software (TOMS)
ADE-4: a multivariate analysis and graphical display software
Statistics and Computing
An evaluation of term dependence models in information retrieval
SIGIR '82 Proceedings of the 5th annual ACM conference on Research and development in information retrieval
An evaluation of required element testing strategies
ICSE '84 Proceedings of the 7th international conference on Software engineering
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
IEEE Transactions on Computers
| Hi-index | 48.24 |
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 nodes of the graph; a minimal spanning tree for a graph of 50 nodes is generated in 0.1 seconds on an IBM System 360/67. Previous algorithms [2, 3, 4, 5] require an amount of computation which depends on the graph topology and edge lengths and are best suited to graphs with few edges.