Practical toroidality testing

Simple item page
dc.contributor.authorNeufeld, Eugene Trivanen_US
dc.date.accessioned2024-08-15T16:33:31Z
dc.date.available2024-08-15T16:33:31Z
dc.date.copyright1993en_US
dc.date.issued1993
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractA torus is a sphere with one handle. A toroidal graph is one that can be embedded in the torus with no overlapping edges. Although various theoretically efficient algo­rithms for testing toroidality of graphs have been published, none is claimed to be "practical". We develop an exponential toroidality tester that is practical enough to compute the minor order obstructions to toroidality on up to ten vertices and which gives indications that there are several thousand of these obstructions all together. We validate the algorithm combinatorially, and discuss prospects of improvements in efficiency.en
dc.format.extent129 pages
dc.identifier.urihttps://hdl.handle.net/1828/19110
dc.rightsAvailable to the World Wide Weben_US
dc.subjectUN SDG 7: Affordable and Clean Energyen
dc.titlePractical toroidality testingen_US
dc.typeThesisen_US

Files

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