ALGORITHM FOR ENUMERATING HYPERGRAPH TRANSVERSALS

Simple item page
dc.contributor.advisorNorris, Boyana
dc.contributor.authorCasita, Roscoe
dc.date.accessioned2018-04-10T15:04:15Z
dc.date.available2018-04-10T15:04:15Z
dc.date.issued2018-04-10
dc.description.abstractThis paper introduces the hypergraph transversal problem along with thefollowing iterative solutions: naive, branch and bound, and dynamic exponentialtime (NC-D). Odometers are introduced along with the functions that manipulatethem. The traditional definitions of hyperedge, hypergraph, etc., are redefined interms of odometers and lists. All algorithms and functions necessary to implementthe solution are presented along with techniques to validate and test the results.Lastly, parallelization advanced applications, and future research directions areexamined.en_US
dc.identifier.urihttps://hdl.handle.net/1794/23160
dc.language.isoen_US
dc.publisherUniversity of Oregon
dc.rightsAll Rights Reserved.
dc.subjectEnumerationen_US
dc.subjectHyperedgeen_US
dc.subjectHypergraphen_US
dc.subjectIterationen_US
dc.subjectOdometeren_US
dc.subjectTransversalen_US
dc.titleALGORITHM FOR ENUMERATING HYPERGRAPH TRANSVERSALS
dc.typeElectronic Thesis or Dissertation
thesis.degree.disciplineDepartment of Computer and Information Science
thesis.degree.grantorUniversity of Oregon
thesis.degree.levelmasters
thesis.degree.nameM.S.

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Casita_oregon_0171N_12040.pdf
Size:
359.93 KB
Format:
Adobe Portable Document Format
Download

Collections

Theses and Dissertations
Computer Science Theses and Dissertations