Maximizing spanning trees in almost complete graphs

Simple item page
dc.contributor.authorGilbert, Bryan Johnen_US
dc.date.accessioned2024-08-13T22:54:51Z
dc.date.available2024-08-13T22:54:51Z
dc.date.copyright1995en_US
dc.date.issued1995
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.format.extent129 pages
dc.identifier.urihttps://hdl.handle.net/1828/17930
dc.rightsAvailable to the World Wide Weben_US
dc.titleMaximizing spanning trees in almost complete graphsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GILBERT_Bryan_John_MSc_1995_686589.pdf
Size:
28.95 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.