Generating spanning trees

Simple item page
dc.contributor.authorSmith, Malcolm Jamesen_US
dc.date.accessioned2024-08-15T18:24:25Z
dc.date.available2024-08-15T18:24:25Z
dc.date.copyright1997en_US
dc.date.issued1997
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractAlgorithms for generating all spanning trees of a graph are presented. A series of improvements to the basic contraction-deletion algorithm results in the development of an algorithm which generates spanning trees in a Gray code order in constant amortized time. The improvements consist of removing loop edges in the graph, replacing sets of parallel edges with a single parallel edge record, and removing degree two vertices and replacing each pair of incident edges with a series edge record.
dc.format.extent88 pages
dc.identifier.urihttps://hdl.handle.net/1828/19740
dc.rightsAvailable to the World Wide Weben_US
dc.titleGenerating spanning treesen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
SMITH_Malcolm_James_MSc_1970_741728.pdf
Size:
19.43 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.