6 citations · 7 across the 7 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015★ 1 cited
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 …
math.CO2015
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…
cs.DS2015
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…