6 citations · 7 across the 7 of their papers we have counts for
9 papers
On the Existence of -Identifying Codes in Undirected De Bruijn Graphs
Victoria Horan
This paper proves the existence of -identifying codes on the class of undirected de Bruijn graphs with string length and alphabet size , referred to as …
Locating Patterns in the De Bruijn Torus
Victoria Horan, Brett Stevens
The de Bruijn torus (or grid) problem looks to find an -by- binary matrix in which every possible -by- submatrix appears exactly once. The existence and construction of…
A Comparison of Approaches for Solving Hard Graph-Theoretic Problems
Victoria Horan, Steve Adachi, Stanley Bak
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational…
Gray Codes and Overlap Cycles for Restricted Weight Words
Victoria Horan, Glenn Hurlbert
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the…
Overlap Cycles for Permutations: Necessary and Sufficient Conditions
Victoria Horan
Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992. They have been developed by many aut…
s-Overlap Cycles for Permutations
Victoria Horan, Glenn Hurlbert
The goal of this paper is to solve Problem 481 from the list of research problems in the special issue of Discrete Mathematics dedicated to the Banff International Research Station…