Publication:
On finding the shortest spanning tree of a graph. February 1974.
On finding the shortest spanning tree of a graph. February 1974.
dc.contributor.author | Fietz, T. R. | en_US |
dc.date.accessioned | 2021-11-25T12:45:56Z | |
dc.date.available | 2021-11-25T12:45:56Z | |
dc.date.issued | 1974 | en_US |
dc.description.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. | en_US |
dc.identifier.isbn | 0858241293 | en_US |
dc.identifier.uri | http://hdl.handle.net/1959.4/36358 | |
dc.language | English | |
dc.language.iso | EN | en_US |
dc.publisher | University of New South Wales - Water Research Laboratory | en_US |
dc.rights | CC BY-NC-ND 3.0 | en_US |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/3.0/au/ | en_US |
dc.source | Legacy MARC | en_US |
dc.source | WRL Digitisation | |
dc.subject.other | water supply | en_US |
dc.subject.other | water distribution | en_US |
dc.subject.other | hydraulics | en_US |
dc.subject.other | graphical analysis | en_US |
dc.subject.other | pipes | en_US |
dc.title | On finding the shortest spanning tree of a graph. February 1974. | en_US |
dc.type | Report | en |
dcterms.accessRights | open access | |
dspace.entity.type | Publication | en_US |
unsw.accessRights.uri | https://purl.org/coar/access_right/c_abf2 | |
unsw.description.notePublic | Supplementary notes: See also Reports 128, 130. | en_US |
unsw.identifier.doi | https://doi.org/10.4225/53/579ae657d0735 | en_US |
unsw.publisher.place | Sydney | en_US |
unsw.relation.faculty | Engineering | |
unsw.relation.ispartofreportnumber | UNSW Water Research Laboratory Report No. 134 | en_US |
unsw.relation.originalPublicationAffiliation | Fietz, T. R., Water Research Laboratory, Faculty of Engineering, UNSW | en_US |
unsw.relation.school | School of Civil and Environmental Engineering | * |
Files
Original bundle
1 - 1 of 1