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.
Welcome to the new UNSWorks platform – content is currently being migrated.
Search for theses and datasets below. Until further notice, other research outputs can be found on Primo UNSWorks.
|
3.29 MB | Adobe Portable Document Format |