1 citations · 1 across the 5 of their papers we have counts for
5 papers
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…
Rainbow numbers of for
Kean Fallon, Ethan Manhart, Joe Miller +3
Consider the set and the equation , namely . The \emph{rainbow number of for }, d…
The effect of the Katz parameter on node ranking, with a medical application
Hunter Rehm, Mona Matar, Puck Rombach +1
Katz centrality is a popular network centrality measure. It takes a (weighted) count of all walks starting at each node, with an additional damping factor of that tunes the inf…
Rainbow numbers of for
Kean Fallon, Colin Giles, Hunter Rehm +2
Consider the set and an equation . The rainbow number of for , denoted , is the smallest number of colors such that…
Anti-van der Waerden Numbers of Graph Products
Hunter Rehm, Alex Schulte, Nathan Warnberg
In this paper, anti-van der Waerden numbers on Cartesian products of graphs are investigated and a conjecture made by Schulte, et al (see arXiv:1802.01509) is answered. In particul…