Dissertation/Thesis Abstract

Algorithm for Enumerating Hypergraph Transversals
by Casita, Roscoe, M.S., University of Oregon, 2017, 59; 10633967
Abstract (Summary)

This 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.

Indexing (document details)
Advisor: Norris, Boyana
Commitee: Norris, Boyana
School: University of Oregon
Department: Computer and Information Science
School Location: United States -- Oregon
Source: MAI 57/01M(E), Masters Abstracts International
Source Type: DISSERTATION
Subjects: Computer science
Keywords: Enumeration, Hyperedge, Hypergraph, Iteration, Odometer, Transversal
Publication Number: 10633967
ISBN: 978-0-355-40036-6
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest