Return to search

ALGORITHM FOR ENUMERATING HYPERGRAPH TRANSVERSALS

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.

Identiferoai:union.ndltd.org:uoregon.edu/oai:scholarsbank.uoregon.edu:1794/23160
Date10 April 2018
CreatorsCasita, Roscoe
ContributorsNorris, Boyana
PublisherUniversity of Oregon
Source SetsUniversity of Oregon
Languageen_US
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
RightsAll Rights Reserved.

Page generated in 0.0016 seconds