Work

Algorithm for Enumerating Hypergraph Transversals

Year: 2018
Type: dissertation
Abstract: 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.
Language: English
Open Access status: green
OpenAlex ID: W2801212796
Cites: 10
Cited by:
Related to: 10