A faster algorithm for torus embedding

Show simple item record

dc.contributor.author Woodcock, Jennifer Roselynn
dc.date.accessioned 2007-07-05T23:12:08Z
dc.date.available 2007-07-05T23:12:08Z
dc.date.copyright 2006 en_US
dc.date.issued 2007-07-05T23:12:08Z
dc.identifier.uri http://hdl.handle.net/1828/130
dc.description.abstract Although theoretically practical algorithms for torus embedding exist, they have not yet been successfully implemented and their complexity may be prohibitive to their practicality. We describe a simple exponential algorithm for embedding graphs on the torus (a surface shaped like a doughnut) and discuss how it was inspired by the quadratic time planar embedding algorithm of Demoucron, Malgrange and Pertuiset. We show that it is faster in practice than the only fully implemented alternative (also exponential) and explain how both the algorithm itself and the knowledge gained during its development might be used to solve the well-studied problem of finding the complete set of torus obstructions. en_US
dc.language English eng
dc.language.iso en en_US
dc.rights Available to the World Wide Web en_US
dc.subject torus en_US
dc.subject obstruction en_US
dc.subject graph theory en_US
dc.subject embedding en_US
dc.subject graph en_US
dc.subject graph minor en_US
dc.subject.lcsh UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science en_US
dc.title A faster algorithm for torus embedding en_US
dc.type Thesis en_US
dc.contributor.supervisor Myrvold, Wendy
dc.contributor.supervisor Ruskey, Frank
dc.degree.department Dept. of Computer Science en_US
dc.degree.level Master of Science M.Sc. en_US

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Search UVicSpace


My Account