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.
On finding the shortest spanning tree of a graph. February 1974.
On finding the shortest spanning tree of a graph. February 1974.
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
|
3.29 MB | Adobe Portable Document Format |