On finding the shortest spanning tree of a graph. February 1974.

Download files
Access & Terms of Use
open access
Abstract
The efficiency of programmable and manual methods of finding the shortest spanning tree of a graph is investigated. Incomplete connecting graphs are the main concern. Computer programs for three methods are included.
Persistent link to this record
Link to Publisher Version
Additional Link
Author(s)
Fietz, T. R.
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
1974
Resource Type
Report
Degree Type
UNSW Faculty
Files
download WRL_Research_Report_134.pdf 3.29 MB Adobe Portable Document Format
Related dataset(s)