PakCat catalogue record

On Finding the Shortest Spaning Tree of a Graph

By Fietz, T.R

Bibliographic details

Summary

The efficiency of programmable and manual methods of finding the shortest spanning tree of a graph is investigaed. Incomplete connected graphs are the main concern. Computer programs for three methods are included.