2 to 1 embeddings of grids into hypercubes

Simple item page
dc.contributor.authorManke, Dennis L.en_US
dc.date.accessioned2024-08-14T22:38:16Z
dc.date.available2024-08-14T22:38:16Z
dc.date.copyright1993en_US
dc.date.issued1993
dc.degree.departmentDepartment of Computer Scienceen_US
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractWe consider two-to-one embeddings of grids into the next smaller Hypercube and derive novel two-to-one embedding techniques that achieve optimal dilation 1 for many grids, where in some cases no previous solutions were known. In particular, dilation 1, two-to-one embeddings into the next smaller Hypercube can be found for grids that are: - square. - close to square. - of height within one of a power of 2.en
dc.format.extent124 pages
dc.identifier.urihttps://hdl.handle.net/1828/18873
dc.rightsAvailable to the World Wide Weben_US
dc.subjectUN SDG 11: Sustainable Cities and Communitiesen
dc.title2 to 1 embeddings of grids into hypercubesen_US
dc.typeThesisen_US

Files

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

Collections

Electronic Theses and Dissertations (ETD)
Theses (Computer Science)
 
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.