Hunter Rehm

collaborators

2 papers

physics.soc-ph2023

Generating Dominating Sets Using Locally-Defined Centrality Measures

Hunter Rehm, Robert Kassouf-Short, Puck Rombach

The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient approximation algorithms, especially in applica…

math.CO2023

Rainbow numbers of $[m] \times [n]$ for $x_{1} + x_{2} = x_{3}$

Kean Fallon, Ethan Manhart, Joe Miller +3

Consider the set $[m] \times [n] = {(i, j) : 1 \leq i \leq m, 1 \leq j \leq n}$ and the equation $x_{1} + x_{2} = x_{3}$ , namely $e q$ . The \emph{rainbow number of $[m] \times [n]$ for $e q$ }, d…

Generating Dominating Sets Using Locally-Defined Centrality Measures

Rainbow numbers of [m]×[n] for x1​+x2​=x3​

Rainbow numbers of $[m] \times [n]$ for $x_{1} + x_{2} = x_{3}$